Amini, O, Esperet, L and van den Heuvel, J (2007) Frugal colouring of graphs. LSE-CDAM-2007-11. London school of economics and political science, London, UK.Full text not available from this repository.
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.
|Item Type:||Monograph (Report)|
|Additional Information:||© 2007 London school of economics and political science|
|Library of Congress subject classification:||H Social Sciences > H Social Sciences (General)|
|Sets:||Departments > Mathematics|
|Date Deposited:||10 Jul 2008 09:37|
Actions (login required)
|Record administration - authorised staff only|