Even cycles in graphs

DOI10.1002/JGT.10156zbMATH Open1033.05062OpenAlexW4240206724MaRDI QIDQ4458731FDOQ4458731

Authors: Joseph G. Conlon 

Publication date: 15 March 2004

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2027.42/34893

Recommendations

• On removable and non-separating even cycles in graphs
• On removable even circuits in graphs
• Non-separating even cycles in highly connected graphs
• Upon the removal of the edges of a 1-factor from an even circuit in a 2-connected graph
• Disjoint even cycles packing

zbMATH Keywords

3-connectedeven cycleremovable

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cited In (10)

• Removable cycles avoiding two connected subgraphs
• Negative circles in signed graphs: a problem collection
• The cycle in 2-connected \([4,2]\)-graphs
• Negative (and positive) circles in signed graphs: a problem collection
• Even Cycles in Directed Graphs
• Non-separating even cycles in highly connected graphs
• Even-cycle decompositions of graphs with no odd-\(K_4\)-minor
• On removable and non-separating even cycles in graphs
• Forbidding induced even cycles in a graph: typical structure and counting
• On removable even circuits in graphs

This page was built for publication: Even cycles in graphs

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