Skip to main content
Article thumbnail
Location of Repository

Frugal colouring of graphs

By O Amini, L Esperet and J van den Heuvel

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

Topics: H Social Sciences (General)
Publisher: London school of economics and political science
Year: 2007
OAI identifier: oai:eprints.lse.ac.uk:6766
Provided by: LSE Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www.cdam.lse.ac.uk/Repo... (external link)
  • http://eprints.lse.ac.uk/6766/ (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.