Contractible bonds in graphs

DOI10.1016/j.jctb.2004.10.002zbMath1057.05050OpenAlexW2171248764MaRDI QIDQ1767670

Sean McGuinness

Publication date: 8 March 2005

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2004.10.002

zbMATH Keywords

BondMinorContractible

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)

Related Items (2)

Note on non-separating and removable cycles in highly connected graphs ⋮ 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 2-Connected Graphs of Minimum Degree at Least Four
• On removable circuits in graphs and matroids
• On decomposing a graph into nontrivial bonds
• Removable Circuits in Binary Matroids

This page was built for publication: Contractible bonds in graphs