|
|||||
|
|
2-reducible cycles containing three consecutive edges in (2k + 1)-edge-connected graphs |
|
| Authors: | Haruko Okamura |
| Affiliation: | (1) Faculty of Engineering, Osaka City University, 558 Sugimoto Osaka, Japan |
| Abstract: | LetG be ak-edge-connected graph and letf1,f0,f2 be consecutive edges. We call a cycleC (not necessarily simple) 2-reducible ifG – E(C) is (k – 2)-edge-connected. We here characterize the graphsG having no 2-reducible cycle containingf1,f0 andf2. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |