The chromatic number of graphs with no induced subdivision of \(K_4\)

DOI10.1007/s00373-020-02148-xzbMath1439.05081OpenAlexW3007875447MaRDI QIDQ2175802

Qing Cui, Yuan Chen, Qinghai Liu, Xing Feng, Guantao Chen

Publication date: 30 April 2020

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-020-02148-x

zbMATH Keywords

subdivisionchromatic numberISK4

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Related Items (3)

The chromatic number of {ISK4, diamond, bowtie}‐free graphs ⋮ Some remarks on graphs with no induced subdivision of \(K_4\) ⋮ A better upper bound on the chromatic number of (cap, even-hole)-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Triangle-free intersection graphs of line segments with large chromatic number
• On graphs with no induced subdivision of \(K_4\)
• Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree
• Chromatic number of ISK4-free graphs
• On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph
• Triangle‐free graphs that do not contain an induced subdivision of K₄ are 3‐colorable

This page was built for publication: The chromatic number of graphs with no induced subdivision of \(K_4\)