The chromatic number of graphs with no induced subdivision of K₄

DOI10.1007/S00373-020-02148-XMaRDI QIDQ2175802zbMATH OpenOpenAlexFDO

Authors Yuan Chen, Qing Cui, Xing Feng, Qinghai Liu, 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

chromatic numbersubdivisionISK4

Mathematics Subject Classification ID

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

Recommendations

• Triangle-free graphs that do not contain an induced subdivision of \(K_4\) are 3-colorable
• On graphs with no induced subdivision of \(K_4\)
• 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
• scientific article; zbMATH DE number 1222840

Cites work

• scientific article; zbMATH DE number 1002021 (Why is no real title available?)
• scientific article; zbMATH DE number 4183452 (Why is no real title available?)
• Chromatic number of ISK4-free graphs
• Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree
• On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph
• On graphs with no induced subdivision of \(K_4\)
• Triangle-free graphs that do not contain an induced subdivision of \(K_4\) are 3-colorable
• Triangle-free intersection graphs of line segments with large chromatic number

Cited in

(11)

• On graphs with no induced subdivision of \(K_4\)
• Some remarks on graphs with no induced subdivision of \(K_4\)
• Totally odd \(K_4\)-subdivisions in 4-chromatic graphs
• The chromatic number of {ISK4, diamond, bowtie}‐free graphs
• Nonseparating K₄‐subdivisions in graphs of minimum degree at least 4
• Detecting an induced subdivision of \(K_4\)
• scientific article; zbMATH DE number 6612443 (Why is no real title available?)
• Counting \(K_4\)-subdivisions
• Chromatic number of ISK4-free graphs
• Triangle-free graphs that do not contain an induced subdivision of \(K_4\) are 3-colorable
• A better upper bound on the chromatic number of (cap, even-hole)-free graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175802)