Unavoidable doubly connected large graphs
From MaRDI portal
Recommendations
Cites work
- Complement reducible graphs
- Dacey Graphs
- scientific article; zbMATH DE number 3889564 (Why is no real title available?)
- Induced subgraphs and well‐quasi‐ordering
- On a class of posets and the corresponding comparability graphs
- Typical subgraphs of 3- and 4-connected graphs
- Unavoidable minors of large 3-connected binary matroids
- Unavoidable minors of large 3-connected matroids
- Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
Cited in
(8)- A Ramsey-type theorem for the matching number regarding connected graphs
- Unavoidable induced subgraphs in large graphs with no homogeneous sets
- scientific article; zbMATH DE number 3981211 (Why is no real title available?)
- scientific article; zbMATH DE number 1556740 (Why is no real title available?)
- Unavoidable subtournaments in large tournaments with no homogeneous sets
- Unavoidable Induced Subgraphs of Large 2-Connected Graphs
- Unavoidable induced subgraphs of infinite 2-connected graphs
- Unavoidable vertex-minors in large prime graphs
This page was built for publication: Unavoidable doubly connected large graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827667)