Chi-boundedness of graph classes excluding wheel vertex-minors

DOI10.1016/j.endm.2017.06.045zbMath1378.05053arXiv1702.07851OpenAlexW2963000066MaRDI QIDQ5915809

O-joung Kwon, Hojin Choi, Sang-il Oum, Paul Wollan

Publication date: 18 January 2018

Published in: Electronic Notes in Discrete Mathematics, Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

chromatic numberwheel\(\chi\)-boundedwheel graphvertex-minor\(\chi\)-bounded class

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Classes of graphs with no long cycle as a vertex-minor are polynomially \(\chi\)-bounded ⋮ Packing and Covering Induced Subdivisions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classes of graphs with small rank decompositions are \(\chi \)-bounded
• Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors
• Induced subgraphs of graphs with large chromatic number. III: Long holes
• Unavoidable vertex-minors in large prime graphs
• On the chromatic number of multiple interval graphs and overlap graphs
• Isotropic systems
• Graphic presentations of isotropic systems
• Reducing prime graphs and recognizing circle graphs
• Circle graph obstructions
• Rank-width and vertex-minors
• A Simple Proof of a Theorem of Erdös and Szekeres^*

This page was built for publication: Chi-boundedness of graph classes excluding wheel vertex-minors