On removable even circuits in graphs

DOI10.1016/j.disc.2004.03.012zbMath1053.05074OpenAlexW2033981405MaRDI QIDQ1887634

Philip Sinclair

Publication date: 22 November 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2004.03.012

zbMATH Keywords

Removable even circuits

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items

Upon the removal of the edges of a 1-factor from an even circuit in a 2-connected graph, Removable cycles avoiding two connected subgraphs, Removing circuits in 3-connected binary matroids

Cites Work

• Unnamed Item
• Unnamed Item
• Non-separating induced cycles in graphs
• Removable circuits in multigraphs
• Kreuzungsfreie a,b-Wege in endlichen Graphen
• Removable Cycles in Planar Graphs
• Removable Cycles in 2-Connected Graphs of Minimum Degree at Least Four
• On removable circuits in graphs and matroids