location:  Publications → journals
Search results

Search: MSC category 05C70 ( Factorization, matching, partitioning, covering and packing )

 Expand all        Collapse all Results 1 - 1 of 1

1. CJM Online first

de Joannis de Verclos, Rémi; Kang, Ross J.; Pastor, Lucas
 Colouring squares of claw-free graphs Is there some absolute $\varepsilon > 0$ such that for any claw-free graph $G$, the chromatic number of the square of $G$ satisfies $\chi(G^2) \le (2-\varepsilon) \omega(G)^2$, where $\omega(G)$ is the clique number of $G$? ErdÅs and NeÅ¡etÅil asked this question for the specific case of $G$ the line graph of a simple graph and this was answered in the affirmative by Molloy and Reed. We show that the answer to the more general question is also yes, and moreover that it essentially reduces to the original question of ErdÅs and NeÅ¡etÅil. Keywords:graph colouring, ErdÅs--NeÅ¡etÅil conjecture, claw-free graphsCategories:05C15, 05C35, 05C70
 top of page | contact us | privacy | site map |