scientific article; zbMATH DE number 3933111

From MaRDI portal
Publication:3708044





[For the entire collection see Zbl 0563.00004.] \textit{H. Fleischner} [Discrete Math. 44, 275-280 (1983; Zbl 0521.05043)] showed that in a cubic 2-connected planar graph, any edge that does not belong to a two-edge cut is a chord of an even cycle. Here the authors show that this result holds in much more general situations (that is, planarity is not needed). They prove that in 3-connected graphs, every pair of edges is almost always contained in both an even and an odd cycle. A full characterization of the exceptional cases is also given.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3708044)