On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph
From MaRDI portal
Publication:2978173
DOI10.1002/JGT.22023zbMath1359.05049arXiv1407.6531OpenAlexW2951507227WikidataQ59889908 ScholiaQ59889908MaRDI QIDQ2978173
Kristina Vušković, Nicolas Trotignon
Publication date: 21 April 2017
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.6531
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
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
Cites Work
This page was built for publication: On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph