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

DOI10.1007/S00373-007-0698-ZzbMATH Open1119.05062OpenAlexW2079758259MaRDI QIDQ2373428FDOQ2373428

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

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

zbMATH Keywords

Minimum degreeSplittingContraction3-Connected graphCrownCrown reduction

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

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

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)