157 search results - page 1 / 32 » Frugal Colouring of Graphs |
124
Voted
CORR
2007
Springer
15 years 2 months ago
2007
Springer
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...
118
Voted
COLOGNETWENTE
2009
15 years 3 months ago
2009
Given a graph G = (V, E), a proper vertex colouring of V is t-frugal if no colour appears more than t times in any neighbourhood and is acyclic if each of the bipartite graphs con...
129
Voted
JCT
2010
15 years 19 days ago
2010
We prove that every graph with maximum degree ∆ can be properly (∆ + 1)coloured so that no colour appears more than O(log ∆/ log log ∆) times in the neighbourhood of any v...
144
Voted
IWPEC
2010
Springer
15 years 3 days ago
2010
Springer
The Grundy number of a graph G, denoted by (G), is the largest k such that G has a greedy k-colouring, that is a colouring with k colours obtained by applying the greedy algorithm ...
301
Voted
Book
A well-written book about graph theory.