Reductions of 3-connected graphs with minimum degree at least four

DOI10.2989/16073606.2017.1391350MaRDI QIDQ3177643zbMATH OpenOpenAlexFDO

Authors Sheng Bau

Publication date 1 August 2018

Published in Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2989/16073606.2017.1391350

zbMATH Keywords

contractionminimum degree3-connected graphcyclically 4-edge connected graphminor inclusion

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Connectivity (05C40) Structural characterization of families of graphs (05C75) Graph minors (05C83)

Recommendations

• Reduction for 3-connected graphs of minimum degree at least four
• Reductions of 3-connected quadrangulations of the sphere
• Weakly 3-Connected Graphs
• Contractible triples in 3-connected graphs
• scientific article; zbMATH DE number 5043408

Cites work

• scientific article; zbMATH DE number 3885951 (Why is no real title available?)
• scientific article; zbMATH DE number 3600073 (Why is no real title available?)
• scientific article; zbMATH DE number 1025912 (Why is no real title available?)
• scientific article; zbMATH DE number 3014115 (Why is no real title available?)
• A recursive characterization of the 4-connected graphs
• Reduction for 3-connected graphs of minimum degree at least four
• Uncontractable 4-connected graphs

Cited in

(3)

• Reductions of 3-connected quadrangulations of the sphere
• Reduction for 3-connected graphs of minimum degree at least four
• scientific article; zbMATH DE number 4130433 (Why is no real title available?)

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

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