Sciweavers

617 search results - page 4 / 124
» On the Chromatic Number of Random Graphs
Sort
View
DM
2008
116views more  DM 2008»
13 years 7 months ago
Total and fractional total colourings of circulant graphs
In this paper, the total chromatic number and fractional total chromatic number of circulant graphs are studied. For cubic circulant graphs we give upper bounds on the fractional ...
Riadh Khennoufa, Olivier Togni
EJC
2008
13 years 7 months ago
On the adaptable chromatic number of graphs
The adaptable chromatic number of a graph G is the smallest integer k such that for any edge k-colouring of G there exists a vertex kcolouring of G in which the same colour never ...
Pavol Hell, Xuding Zhu
JGT
2010
135views more  JGT 2010»
13 years 6 months ago
Cycle length parities and the chromatic number
In 1966 Erd˝os and Hajnal proved that the chromatic number of graphs whose
Christian Löwenstein, Dieter Rautenbach, Ingo...
CPC
2007
95views more  CPC 2007»
13 years 7 months ago
Colouring Random Regular Graphs
In a previous paper we showed that a random 4-regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6-regular...
Lingsheng Shi, Nicholas C. Wormald
ENDM
2006
119views more  ENDM 2006»
13 years 7 months ago
The incidence game chromatic number
We introduce the incidence game chromatic number which unifies the ideas of game chromatic number and incidence coloring number of an undirected graph. For kdegenerate graphs with...
Stephan Dominique Andres