Abstract: A graph is said to be ISK4-free if it does not contain any subdivision of as an induced subgraph. In this paper, we propose new upper bounds for chromatic number of ISK4-free graphs and ISK4, triangle-free graphs.
Recommendations
Cites work
- Graph theory
- scientific article; zbMATH DE number 1002021 (Why is no real title available?)
- scientific article; zbMATH DE number 4183452 (Why is no real title available?)
- Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree
- On graphs with no induced subdivision of \(K_4\)
- On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph
- Restricted frame graphs and a conjecture of Scott
- Triangle-free graphs that do not contain an induced subdivision of K₄ are 3-colorable
- Triangle-free intersection graphs of line segments with large chromatic number
Cited in
(5)- Stable sets in \(\{\mathrm{ISK4,wheel}\}\)-free graphs
- 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\)
- 2P₃-free graphs that do not contain any induced subdivision of K₄ are 4-colorable
This page was built for publication: Chromatic number of ISK4-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1696549)
