On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques

DOI10.1007/s10878-023-01088-5OpenAlexW4387654926MaRDI QIDQ6084676

Xia Zhang, Weilun Xu

Publication date: 6 November 2023

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-023-01088-5

zbMATH Keywords

chromatic number\(P_5\)-free graphintersecting cliquespolynomial \(\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
• On the chromatic number of \((P_{5},K_{2,t})\)-free graphs
• The strong perfect graph theorem
• A bound on the chromatic number of graphs without certain induced subgraphs
• Dominating cliques in \(P_ 5\)-free graphs
• Coloring the hypergraph of maximal cliques of a graph with no long path
• On the chromatic number of \(2 K_2\)-free graphs
• Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
• Chromatic bounds for some classes of \(2 K_2\)-free graphs
• On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
• The chromatic number of \(\{P_5,K_4\}\)-free graphs
• Vizing bound for the chromatic number on some graph classes
• Graph Theory and Probability
• On the chromatic number of (P_{5},windmill)-free graphs
• Perfect divisibility and 2‐divisibility
• On graphs with no induced five‐vertex path or paraglider
• Polynomial bounds for chromatic number. IV: A near-polynomial bound for excluding the five-vertex path
• Coloring graphs with no induced five‐vertex path or gem

This page was built for publication: On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques