Unavoidable vertex-minors in large prime graphs

DOI10.1016/j.ejc.2014.03.013zbMath1300.05255arXiv1306.3066OpenAlexW2026359334MaRDI QIDQ740266

Sang-il Oum, O-joung Kwon

Publication date: 2 September 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.3066

zbMATH Keywords

complete bipartite graph

Mathematics Subject Classification ID

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

Related Items (7)

Unavoidable Subtournaments in Large Tournaments with No Homogeneous Sets ⋮ Graphs of bounded depth‐2 rank‐brittleness ⋮ Chi-boundedness of graph classes excluding wheel vertex-minors ⋮ Classes of graphs with no long cycle as a vertex-minor are polynomially \(\chi\)-bounded ⋮ Obstructions for bounded shrub-depth and rank-depth ⋮ Scattered Classes of Graphs ⋮ Unavoidable induced subgraphs in large graphs with no homogeneous sets

Cites Work

• Unnamed Item
• Unnamed Item
• Typical subgraphs of 3- and 4-connected graphs
• Reconnaissance des graphes de cordes
• Isotropic systems
• Graphic presentations of isotropic systems
• Reducing prime graphs and recognizing circle graphs
• Circle graph obstructions
• Unavoidable doubly connected large graphs
• Unavoidable minors of large 3-connected binary matroids
• Approximating clique-width and branch-width
• Rank-width and vertex-minors
• Circle graph obstructions under pivoting
• Unavoidable parallel minors of 4-connected graphs
• Decomposition of Directed Graphs
• Recognizing circle graphs in polynomial time
• Graph-Theoretic Concepts in Computer Science

This page was built for publication: Unavoidable vertex-minors in large prime graphs