2000 character limit reached
Reed's conjecture on some special classes of graphs (1205.0730v2)
Published 3 May 2012 in cs.DM
Abstract: Reed conjectured that for any graph $G$, $\chi(G) \leq \lceil \frac{\omega(G)+\Delta(G)+1}{2}\rceil$, where $\chi(G)$, $\omega(G)$, and $\Delta(G)$ respectively denote the chromatic number, the clique number and the maximum degree of $G$. In this paper, we verify this conjecture for some special classes of graphs, in particular for subclasses of $P_5$-free graphs or $Chair$-free graphs.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
