ISSN:
1435-5914
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract LetG be ak-edge-connected graph and letf 1,f 0,f 2 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 containingf 1,f 0 andf 2.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01929484