Unavoidable doubly connected large graphs

DOI10.1016/j.disc.2003.05.006zbMath1041.05053OpenAlexW2061852760MaRDI QIDQ1827667

Guoli Ding, Peter P. Chen

Publication date: 6 August 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2003.05.006

zbMATH Keywords

Ramsey-type theoremInduced subgraphCographDoubly connected graphUnavoidable graphWell quasi order

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Generalized Ramsey theory (05C55)

Related Items (4)

Unavoidable Subtournaments in Large Tournaments with No Homogeneous Sets ⋮ A Ramsey-type theorem for the matching number regarding connected graphs ⋮ Unavoidable vertex-minors in large prime graphs ⋮ Unavoidable induced subgraphs in large graphs with no homogeneous sets

Cites Work

• Unnamed Item
• Typical subgraphs of 3- and 4-connected graphs
• Complement reducible graphs
• On a class of posets and the corresponding comparability graphs
• Unavoidable minors of large 3-connected matroids
• Unavoidable minors of large 3-connected binary matroids
• Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor
• Dacey Graphs
• Induced subgraphs and well‐quasi‐ordering

This page was built for publication: Unavoidable doubly connected large graphs