A chain theorem for 4-connected graphs

DOI10.1016/J.JCTB.2018.07.005MaRDI QIDQ1633762zbMATH OpenOpenAlexWikidataFDO

Authors Chengfu Qin, Guoli Ding

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

4-connected graphschain theoremcontractible edgenonplanar graphs

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• A chain theorem for 4-connected matroids
• Chain Decompositions of 4-Connected Graphs
• Strengthened chain theorems for different versions of 4-connectivity
• A chain theorem for internally 4-connected binary matroids
• A constructive characterization of 4-connected graphs
• A chain theorem for \(3^+\)-connected graphs
• A recursive characterization of the 4-connected graphs
• Nonseparating Planar Chains in 4-Connected Graphs
• scientific article; zbMATH DE number 2079338
• A characterization of weakly four‐connected graphs

Cites work

• A characterization of graphs with no cube minor
• An excluded minor theorem for the octahedron
• An excluded minor theorem for the Octahedron plus an edge
• Contractible edges in a 4-connected graph with vertices of degree greater than four
• Graphs with no \(\bar{P}_7\)-minor
• How to Draw a Graph
• scientific article; zbMATH DE number 3643299 (Why is no real title available?)
• scientific article; zbMATH DE number 3885951 (Why is no real title available?)
• scientific article; zbMATH DE number 3745246 (Why is no real title available?)
• scientific article; zbMATH DE number 3600073 (Why is no real title available?)
• Uncontractable 4-connected graphs

Cited in

(10)

• Strengthened chain theorems for different versions of 4-connectivity
• A constructive characterization of 4-connected graphs
• A recursive characterization of the 4-connected graphs
• Linkage for the diamond and the path with four vertices
• Reconfiguration of graph minors
• THE EXISTENCE CONDITION OF A 4-CONNECTED GRAPH WITH SPECIFIED CONFIGURATIONS
• Nonseparating Planar Chains in 4-Connected Graphs
• Refining a chain theorem from matroids to internally 4-connected graphs
• The excluded minor theorem for the Petersen graph contracting exactly two edges of a perfect matching and one other edge
• A characterization of \(4\)-connected graphs with no \(K_{3, 3}+v\)-minor

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1633762)