Typical subgraphs of 3- and 4-connected graphs

DOI10.1006/JCTB.1993.1019zbMATH Open0728.05041OpenAlexW1971261527MaRDI QIDQ804594FDOQ804594

Authors: Bogdan Oporowski, Robin Thomas, James Oxley 

Publication date: 1993

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1993.1019

Recommendations

• Generating internally four-connected graphs
• An included-minor result for 3-connected graphs with contractible edges
• Unavoidable parallel minors of 4-connected graphs
• The subgraph homeomorphism problem for small wheels
• \(K_{a,k}\) minors in graphs of bounded tree-width

zbMATH Keywords

minorconnectivitysubdivision

Mathematics Subject Classification ID

Connectivity (05C40)

Cited In (41)

• Unavoidable induced subgraphs in large graphs with no homogeneous sets
• Ubiquity and the Farey graph
• Unavoidable subtournaments in large tournaments with no homogeneous sets
• Unavoidable parallel minors of 4-connected graphs
• Planar graphs with no 6-wheel minor
• A Menger-like property of tree-cut width
• Unavoidable vertex-minors in large prime graphs
• Subdivisions of large complete bipartite graphs and long induced paths in k‐connected graphs
• The edge-density for \(K_{2,t}\) minors
• Unavoidable Induced Subgraphs of Large 2-Connected Graphs
• Unavoidable minors of large 3-connected matroids
• Every infinitely edge-connected graph contains the Farey graph or \({T_{\aleph_0}\ast t}\) as a minor
• Capturing matroid elements in unavoidable 3-connected minors
• Unavoidable minors of large 4-connected bicircular matroids
• Linear connectivity forces large complete bipartite minors
• The circumference of a graph with no \(K_{3,t}\)-minor
• Bicircular matroids representable over \(\mathrm{GF}(4)\) or \(\mathrm{GF}(5)\)
• Unavoidable doubly connected large graphs
• Directed tree-width
• Unavoidable parallel minors of regular matroids
• \(K_{a,k}\) minors in graphs of bounded tree-width
• Unavoidable topological minors of infinite graphs
• Some recent progress and applications in graph minor theory
• Large non-planar graphs and an application to crossing-critical graphs
• A Ramsey-type theorem for the matching number regarding connected graphs
• Universal graphs with forbidden wheel minors
• Nested cycles in large triangulations and crossing-critical graphs
• The circumference of a graph with no \(K_{3,t}\)-minor. II
• Bounding and stabilizing realizations of biased graphs with a fixed group
• Characterising \(k\)-connected sets in infinite graphs
• The subgraph homeomorphism problem for small wheels
• Lift-contractions
• Lift contractions
• Unavoidable minors of graphs of large type
• \(K_{6}\) minors in 6-connected graphs of bounded tree-width
• Large \(W_k\)- or \(K_{3,t}\)-minors in 3-connected graphs
• Generating internally four-connected graphs
• Duality theorems for stars and combs I: Arbitrary stars and combs
• Maximizing the number of \(x\)-colorings of 4-chromatic graphs
• A note on highly connected \(K_{2, \ell}\)-minor free graphs
• Minors in large almost-5-connected non-planar graphs

This page was built for publication: Typical subgraphs of 3- and 4-connected graphs

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