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

DOI10.2989/16073606.2017.1391350zbMATH Open1392.05063OpenAlexW2767634364MaRDI QIDQ3177643FDOQ3177643

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

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

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)

Cites Work

• Title not available (Why is that?)
• Uncontractable 4-connected graphs
• A recursive characterization of the 4-connected graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Reduction for 3-connected graphs of minimum degree at least four

Cited In (3)

• Title not available (Why is that?)
• Reductions of 3-connected quadrangulations of the sphere
• Reduction for 3-connected graphs of minimum degree at least four

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)