Sciweavers

Share
159 search results - page 1 / 32
» Frugal Colouring of Graphs
Sort
View
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
COLOGNETWENTE
2009
9 years 11 months ago
Acyclic and Frugal Colourings of Graphs
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...
Ross J. Kang, Tobias Müller
JCT
2010
101views more  JCT 2010»
9 years 9 months ago
Asymptotically optimal frugal colouring
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...
Michael Molloy, Bruce A. Reed
ICPR
2008
IEEE
10 years 5 months ago
A colour text/graphics separation based on a graph representation
In this paper, a colour text/graphics segmentation is proposed. Firstly, it takes advantage of colour properties by computing a relevant hybrid colour model. Then an edge detectio...
Romain Raveaux, Jean-Christophe Burie, Jean-Marc O...

Book
1174views
11 years 8 months ago
Graph Theory
A well-written book about graph theory.
Reinhard Diestel
books