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

DOI10.1007/S00373-020-02148-XzbMATH Open1439.05081OpenAlexW3007875447MaRDI QIDQ2175802FDOQ2175802

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

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)

Cites Work

• Title not available (Why is that?)
• 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\)
• 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

Cited In (7)

• 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
• Title not available (Why is that?)
• Counting \(K_4\)-subdivisions
• 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)