Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-09T09:04:26.374Z Has data issue: false hasContentIssue false
  • English
  • Français

On the Strong Chromatic Number

Published online by Cambridge University Press:  03 November 2004

P. E. HAXELL
P. E. HAXELL
Affiliation:
Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1 (e-mail: pehaxell@math.uwaterloo.ca)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let $G$ be a finite graph with maximum degree at most $d$. Then, for every partition of $V(G)$ into classes of size $3d-1$, there exists a proper colouring of $G$ with $3d-1$ colours in which each class receives all $3d-1$ colours.

Information

Type
Paper
Information
Combinatorics, Probability and Computing , Volume 13 , Issue 6 , November 2004 , pp. 857 - 865
Copyright
2004 Cambridge University Press