Triangle‐free graphs that do not contain an induced subdivision of K4 are 3‐colorable

DOI10.1002/jgt.22441zbMath1425.05053DBLPjournals/jgt/ChudnovskyLSSTV19arXiv1704.08104OpenAlexW2964052341WikidataQ61821427 ScholiaQ61821427MaRDI QIDQ5241606

Oliver Schaudt, Sophie Spirkl, Kristina Vušković, Chun-Hung Liu, Maria Chudnovsky, Nicolas Trotignon

Publication date: 31 October 2019

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

induced subgraphcoloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

The chromatic number of graphs with no induced subdivision of \(K_4\) ⋮ The chromatic number of {ISK4, diamond, bowtie}‐free graphs ⋮ Some remarks on graphs with no induced subdivision of \(K_4\) ⋮ Chromatic number of ISK4-free graphs

This page was built for publication: Triangle‐free graphs that do not contain an induced subdivision of K₄ are 3‐colorable