Sciweavers

Share
CORR
2007
Springer
116views Education» more  CORR 2007»
9 years 10 months ago
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...
Omid Amini, Louis Esperet, Jan van den Heuvel
books