On the chromatic number of (P5,dart)-free graphs

DOI10.1142/s1793830922500902zbMath1517.05062OpenAlexW4224013327MaRDI QIDQ6132236

Xia Zhang, Weilun Xu

Publication date: 14 July 2023

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830922500902

zbMATH Keywords

chromatic number\(P_5\)-free graphs\(\chi\)-boundedness

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Chromatic number of \(P_5\)-free graphs: Reed's conjecture
• The strong perfect graph theorem
• Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
• The chromatic number of \(\{P_5,K_4\}\)-free graphs
• Vizing bound for the chromatic number on some graph classes
• Graph Theory and Probability
• Perfect divisibility and 2‐divisibility

This page was built for publication: On the chromatic number of (P5,dart)-free graphs