The chromatic number of graphs with no induced subdivision of K₄
From MaRDI portal
Publication:2175802
DOI10.1007/S00373-020-02148-XzbMATH Open1439.05081OpenAlexW3007875447MaRDI QIDQ2175802FDOQ2175802
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
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
- Title not available (Why is that?)
- Triangle-free intersection graphs of line segments with large chromatic number
- On graphs with no induced subdivision of \(K_4\)
- Title not available (Why is that?)
- 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_4\) are 3-colorable
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 K4‐subdivisions in graphs of minimum degree at least 4
- Detecting an induced subdivision of \(K_4\)
- Title not available (Why is that?)
- 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)
