Some remarks on graphs with no induced subdivision of \(K_4\)

DOI10.1016/j.dam.2023.06.031zbMath1528.05026MaRDI QIDQ6064854

Yidong Zhou, Kaiyang Lan, Unnamed Author

Publication date: 11 December 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

chromatic numberinduced subgraph\(\operatorname{ISK}_4\)

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• 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
• \(K_{4}\)-free graphs with no odd holes
• Chromatic number of ISK4-free graphs
• The chromatic number of graphs with no induced subdivision of \(K_4\)
• On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph
• A survey of χ‐boundedness
• Triangle‐free graphs that do not contain an induced subdivision of K₄ are 3‐colorable
• The chromatic number of {ISK4, diamond, bowtie}‐free graphs

This page was built for publication: Some remarks on graphs with no induced subdivision of \(K_4\)