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

DOI10.2989/16073606.2017.1391350zbMath1392.05063OpenAlexW2767634364MaRDI QIDQ3177643

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) Structural characterization of families of graphs (05C75) Graph minors (05C83) Connectivity (05C40) Vertex degrees (05C07)

Cites Work

• A recursive characterization of the 4-connected graphs
• Reduction for 3-connected graphs of minimum degree at least four
• Uncontractable 4-connected graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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