Frugal Colouring of Graphs
| dc.creator | Amini, Omid | |
| dc.creator | Esperet, Louis | |
| dc.creator | Heuvel, Jan Van Den | |
| dc.date | 2007-05-03 | |
| dc.date.accessioned | 2026-07-07T07:59:16Z | |
| dc.date.available | 2026-07-07T07:59:16Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0705.0422 | |
| dc.identifier | http://arxiv.org/abs/0705.0422 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/128305 | |
| dc.subject | Discrete Mathematics | |
| dc.subject | Networking and Internet Architecture | |
| dc.title | Frugal Colouring of Graphs | |
| dc.type | text |