Frugal Colouring of Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2007

Frugal Colouring of Graphs


A $k$-frugal colouring of a graph~$G$ is a proper colouring of the vertices of~$G$ such that no colour appears more than~$k$ times in the neighbourhood of a vertex. This type of colouring was introduced by Hind, Molloy and Reed in 1997. In this paper, we study the frugal chromatic number of planar graphs, planar graphs with large girth, and outerplanar graphs, and relate this parameter with several well-studied colourings, such as colouring of the square, cyclic colouring, and $L(p,q)$-labelling. We also study frugal edge-colourings of multigraphs.
Fichier principal
Vignette du fichier
RR-6178.pdf (310 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00144318 , version 1 (02-05-2007)
inria-00144318 , version 2 (03-05-2007)


  • HAL Id : inria-00144318 , version 2
  • ARXIV : 0705.0422


Omid Amini, Louis Esperet, Jan van den Heuvel. Frugal Colouring of Graphs. [Research Report] RR-6178, INRIA. 2007, pp.12. ⟨inria-00144318v2⟩
182 View
76 Download



Gmail Facebook Twitter LinkedIn More