Even cycles in graphs

DOI10.1002/JGT.10156MaRDI QIDQ4458731zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

3-connectedeven cycleremovable

Mathematics Subject Classification ID

Paths and cycles (05C38)

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

Cited in

(10)

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