Frugal Colouring of Graphs

1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : 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.
Document type :
Reports
Domain :

https://hal.inria.fr/inria-00144318
Contributor : Omid Amini <>
Submitted on : Wednesday, May 2, 2007 - 4:42:45 PM
Last modification on : Monday, October 12, 2020 - 10:30:18 AM
Long-term archiving on: : Wednesday, April 7, 2010 - 1:17:21 AM

Files

RR-Frugal.pdf
Files produced by the author(s)

Identifiers

• HAL Id : inria-00144318, version 1

Citation

Omid Amini, Louis Esperet, Jan van den Heuvel. Frugal Colouring of Graphs. [Research Report] 2007. ⟨inria-00144318v1⟩

Record views