Skip to main content Accessibility help

Squared Chromatic Number Without Claws or Large Cliques

  • Wouter Cames van Batenburg (a1) and Ross J. Kang (a2)


Let $G$ be a claw-free graph on $n$ vertices with clique number $\unicode[STIX]{x1D714}$ , and consider the chromatic number $\unicode[STIX]{x1D712}(G^{2})$ of the square $G^{2}$ of $G$ . Writing $\unicode[STIX]{x1D712}_{s}^{\prime }(d)$ for the supremum of $\unicode[STIX]{x1D712}(L^{2})$ over the line graphs $L$ of simple graphs of maximum degree at most $d$ , we prove that $\unicode[STIX]{x1D712}(G^{2})\leqslant \unicode[STIX]{x1D712}_{s}^{\prime }(\unicode[STIX]{x1D714})$ for $\unicode[STIX]{x1D714}\in \{3,4\}$ . For $\unicode[STIX]{x1D714}=3$ , this implies the sharp bound $\unicode[STIX]{x1D712}(G^{2})\leqslant 10$ . For $\unicode[STIX]{x1D714}=4$ , this implies $\unicode[STIX]{x1D712}(G^{2})\leqslant 22$ , which is within 2 of the conjectured best bound. This work is motivated by a strengthened form of a conjecture of Erdős and Nešetřil.



Hide All

Author W. C. v. B. was supported by NWO grant 613.001.217. Author R. J. K. is supported by a NWO Vidi Grant, reference 639.032.614.



Hide All
[1] Andersen, L. D., The strong chromatic index of a cubic graph is at most 10. Topological, algebraical and combinatorial structures . Discrete Math. 108(1992), no. 1–3, 231252., 1992.
[2] Chudnovsky, M. and Seymour, P., The structure of claw-free graphs . In: Surveys in combinatorics 2005, London Math. Soc. Lecture Note Ser., 327, Cambridge University Press, Cambridge, 2005, pp. 153171.
[3] Chudnovsky, M. and Seymour, P., Claw-free graphs VI. Colouring . J. Combin. Theory Ser. B 100(2010), 560572.
[4] Cranston, D. W., Strong edge-coloring of graphs with maximum degree 4 using 22 colors . Discrete Math. 306(2006), 27722778.
[5] de Joannis de Verclos, R., Kang, R. J., and Pastor, L., Colouring squares of claw-free graphs . Canad. J. Math., to appear.
[6] Erdős, P., Problems and results in combinatorial analysis and graph theory . In: Proceedings of the First Japan Conference on Graph Theory and Applications (Hakone, 1986), Discrete Math. 72(1988), 8192.
[7] Erdős, P. and Szekeres, G., A combinatorial problem in geometry . Compositio Math. 2(1935), 463470.
[8] Horák, P., He, Q., and Trotter, W. T., Induced matchings in cubic graphs . J. Graph Theory 17(1993), 151160.
[9] Molloy, M. and Reed, B., A bound on the strong chromatic index of a graph . J. Combin. Theory Ser. B 69(1997), 103109.
MathJax is a JavaScript display engine for mathematics. For more information see


MSC classification

Squared Chromatic Number Without Claws or Large Cliques

  • Wouter Cames van Batenburg (a1) and Ross J. Kang (a2)


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed