A chain theorem for 4-connected graphs

DOI10.1016/j.jctb.2018.07.005zbMath1402.05126OpenAlexW2884574995WikidataQ129498467 ScholiaQ129498467MaRDI QIDQ1633762

Guoli Ding, Chengfu Qin

Publication date: 20 December 2018

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.2018.07.005

zbMATH Keywords

chain theoremcontractible edgenonplanar graphs4-connected graphs

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (3)

A constructive characterization of 4-connected graphs ⋮ Unnamed Item ⋮ Strengthened chain theorems for different versions of 4-connectivity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs with no \(\bar{P}_7\)-minor
• A characterization of graphs with no cube minor
• Contractible edges in a 4-connected graph with vertices of degree greater than four
• Uncontractable 4-connected graphs
• An excluded minor theorem for the octahedron
• An excluded minor theorem for the Octahedron plus an edge
• How to Draw a Graph

This page was built for publication: A chain theorem for 4-connected graphs