Induced subgraphs of graphs with large chromatic number. IV: Consecutive holes

DOI10.1016/j.jctb.2018.03.006zbMath1391.05118arXiv1509.06563MaRDI QIDQ723885

P. D. Seymour, Alexander D. Scott

Publication date: 24 July 2018

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

holes; induced subgraphs; graph colouring; \(\chi\)-boundedness

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)