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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Frank, A.: On a theorem of Mader. Discrete Mathematics101, 49–57 (1992)
Huck, A., Okamura, H.: Counterexamples to a conjecture of Mader about cycles through specified vertices inn-edge-connected graphs. Graphs and Comb.8, 253–258 (1992)
Mader, W.: A reduction method for edge-connectivity in graphs. Ann. Discrete Math.3, 145–164 (1978)
Mader, W.: Paths in graphs, reducing the edge-connectivity only by two. Graphs and Comb.1, 81–89 (1985)
Okamura, H.: Paths and edge-connectivity in graphs. J. Comb. Theory Ser. B37, 151–172 (1984)
Okamura, H.: Paths ink-edge-connected graphs. J. Comb. Theory Ser. B45, 345–355 (1988)
Okamura, H.: Cycles containing three consecutive edges in 2k-edge-connected graphs, Topics in Combinatorics and Graph Theory (eds. R. Bodendiek and R. Henn), Physica-Verlag Heidelberg (1991), 549–553
Okamura, H.: 2-reducible cycles containing two specified edges in (2k + 1)-edgeconnected graphs, Contemporary Math.147, 259–277 (1993)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Okamura, H. 2-reducible cycles containing three consecutive edges in (2k + 1)-edge-connected graphs. Graphs and Combinatorics 11, 141–170 (1995). https://doi.org/10.1007/BF01929484
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01929484