The chromatic number of {ISK4, diamond, bowtie}‐free graphs

DOI10.1002/jgt.22631zbMath1529.05060OpenAlexW3097763458MaRDI QIDQ6055409

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

Publication date: 29 September 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22631

zbMATH Keywords

chromatic numberdiamondbowtie

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Spectral extremal graphs for the bowtie ⋮ Some remarks on graphs with no induced subdivision of \(K_4\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Restricted frame graphs and a conjecture of Scott
• Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures
• Induced subgraphs of graphs with large chromatic number. I. Odd holes
• 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
• Induced subgraphs of graphs with large chromatic number. III: Long holes
• Chromatic number of ISK4-free graphs
• The chromatic number of graphs with no induced subdivision of \(K_4\)
• Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes
• Excluding Induced Subdivisions of the Bull and Related 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 {ISK4, diamond, bowtie}‐free graphs