Large Wk- or K3,t-Minors in 3-Connected Graphs

DOI10.1002/jgt.21895zbMath1339.05376OpenAlexW1587939554MaRDI QIDQ2811204

Stan Dziobiak, Haidong Wu, Guoli Ding

Publication date: 10 June 2016

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.21895

zbMATH Keywords

circumferencegraph minors3-connected graphscocircumference

Mathematics Subject Classification ID

Graph minors (05C83) Connectivity (05C40)

Related Items (5)

Computing the largest bond and the maximum connected cut of a graph ⋮ On the bond polytope ⋮ Branch-depth: generalizing tree-depth of graphs ⋮ Excluding a large theta graph ⋮ Characterizing matroids whose bases form graphic delta-matroids

Cites Work

• Capturing matroid elements in unavoidable 3-connected minors
• Typical subgraphs of 3- and 4-connected graphs
• Longest cycles in 3-connected cubic graphs
• Relative lengths of paths and cycles in 3-connected graphs
• Long cycles in 3-connected graphs
• Unavoidable minors of large 3-connected binary matroids
• The circumference of a graph with no \(K_{3,t}\)-minor. II
• Capturing two elements in unavoidable minors of 3-connected binary matroids
• A sharp bound on the size of a connected matroid
• A Decomposition for Combinatorial Geometries

This page was built for publication: Large Wk- or K3,t-Minors in 3-Connected Graphs