Typical subgraphs of 3- and 4-connected graphs
From MaRDI portal
Publication:804594
DOI10.1006/jctb.1993.1019zbMath0728.05041OpenAlexW1971261527MaRDI QIDQ804594
Robin Thomas, Bogdan Oporowski, James G. 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
Related Items (36)
Every infinitely edge-connected graph contains the Farey graph or \({T_{\aleph_0}\ast t}\) as a minor ⋮ Bicircular matroids representable over \(\mathrm{GF}(4)\) or \(\mathrm{GF}(5)\) ⋮ Minors in large almost-5-connected non-planar graphs ⋮ The circumference of a graph with no \(K_{3,t}\)-minor ⋮ Bounding and stabilizing realizations of biased graphs with a fixed group ⋮ Characterising \(k\)-connected sets in infinite graphs ⋮ Some recent progress and applications in graph minor theory ⋮ Unavoidable topological minors of infinite graphs ⋮ Unavoidable minors of large 3-connected matroids ⋮ Unavoidable Subtournaments in Large Tournaments with No Homogeneous Sets ⋮ The circumference of a graph with no \(K_{3,t}\)-minor. II ⋮ The edge-density for \(K_{2,t}\) minors ⋮ Duality theorems for stars and combs I: Arbitrary stars and combs ⋮ \(K_{6}\) minors in 6-connected graphs of bounded tree-width ⋮ Unavoidable Induced Subgraphs of Large 2-Connected Graphs ⋮ Large non-planar graphs and an application to crossing-critical graphs ⋮ Capturing matroid elements in unavoidable 3-connected minors ⋮ Maximizing the number of \(x\)-colorings of 4-chromatic graphs ⋮ Planar graphs with no 6-wheel minor ⋮ A Menger-like property of tree-cut width ⋮ Unnamed Item ⋮ Unavoidable parallel minors of regular matroids ⋮ A Ramsey-type theorem for the matching number regarding connected graphs ⋮ Lift-contractions ⋮ Ubiquity and the Farey graph ⋮ Unavoidable vertex-minors in large prime graphs ⋮ Large Wk- or K3,t-Minors in 3-Connected Graphs ⋮ Unavoidable parallel minors of 4-connected graphs ⋮ Subdivisions of large complete bipartite graphs and long induced paths in k‐connected graphs ⋮ Linear connectivity forces large complete bipartite minors ⋮ Nested cycles in large triangulations and crossing-critical graphs ⋮ Unavoidable doubly connected large graphs ⋮ Directed tree-width ⋮ \(K_{a,k}\) minors in graphs of bounded tree-width ⋮ Unavoidable minors of large 4-connected bicircular matroids ⋮ Unavoidable induced subgraphs in large graphs with no homogeneous sets
This page was built for publication: Typical subgraphs of 3- and 4-connected graphs
