On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph

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

zbMATH Keywords

coloringdecompostioninduced subdivision of K4

Mathematics Subject Classification ID

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

• On graphs with no induced subdivision of \(K_4\)
• Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree
• Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It

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