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