Large W_k- or K₃,t-minors in 3-connected graphs

DOI10.1002/JGT.21895MaRDI QIDQ2811204zbMATH OpenOpenAlexFDO

Authors Guoli Ding, Stan Dziobiak, Haidong Wu

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

Connectivity (05C40) Graph minors (05C83)

Recommendations

• \(K_{a,k}\) minors in graphs of bounded tree-width
• The circumference of a graph with no \(K_{3,t}\)-minor. II
• The circumference of a graph with no \(K_{3,t}\)-minor
• Unavoidable minors of large 3-connected binary matroids
• \(K_{6}\) minors in 6-connected graphs of bounded tree-width

Cites work

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

Cited in

(5)

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

This page was built for publication: Large \(W_k\)- or \(K_{3,t}\)-minors in 3-connected graphs

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