Reduction for 3-connected graphs of minimum degree at least four

DOI10.1007/S00373-007-0698-ZMaRDI QIDQ2373428zbMATH OpenOpenAlexFDO

Authors Sheng Bau, Akira Saito

Publication date 19 July 2007

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-007-0698-z

zbMATH Keywords

Minimum degreeSplittingContraction3-Connected graphCrownCrown reduction

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• Reductions of 3-connected graphs with minimum degree at least four
• Splitting and contractible edges in 4-connected graphs
• Nonseparating K₄‐subdivisions in graphs of minimum degree at least 4
• Reductions of 3-connected quadrangulations of the sphere
• Weakly 3-Connected Graphs

Cites work

• scientific article; zbMATH DE number 3600073 (Why is no real title available?)
• A recursive characterization of the 4-connected graphs
• Contractible edges in 3-connected graphs
• Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4]\)
• Contractible subgraphs in 3-connected graphs
• Cyclic coloration of 3-polytopes
• Kuratowski's theorem
• Splitting and contractible edges in 4-connected graphs
• Uncontractable 4-connected graphs
• Untersuchungen über minimale \(n\)-fach zusammenhängende Graphen

Cited in

(3)

• Splitting and contractible edges in 4-connected graphs
• Twenty years of progress of \(\mathrm{JCDCG}^3\)
• Reductions of 3-connected graphs with minimum degree at least four

This page was built for publication: Reduction for 3-connected graphs of minimum degree at least four

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