How to contract an essentially 6-connected graph to a 5-connected graph

DOI10.1016/j.disc.2005.09.040zbMath1109.05062OpenAlexW2076424041MaRDI QIDQ864138

Matthias Kriesell

Publication date: 13 February 2007

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

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

zbMATH Keywords

contractionminorconnectivity

Mathematics Subject Classification ID

Graph minors (05C83) Connectivity (05C40)

Related Items (5)

Contractions, cycle double covers, and cyclic colorings in locally connected graphs ⋮ A constructive characterization of 3-connected triangle-free graphs ⋮ The removable edges and the contractible subgraphs of 5-connected graphs ⋮ The contractible subgraph of 5-connected graphs ⋮ How to contract a vertex transitive 5-connected graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Contractions, cycle double covers, and cyclic colorings in locally connected graphs
• A survey on contractible edges in graphs of a prescribed vertex connectivity
• Graph minors. IV: Tree-width and well-quasi-ordering
• Cyclic coloration of 3-polytopes
• Kuratowski's theorem
• Uncontractable 4-connected graphs

This page was built for publication: How to contract an essentially 6-connected graph to a 5-connected graph