Sciweavers

Share
292 search results - page 1 / 59
» On the adaptable chromatic number of graphs
Sort
View
EJC
2008
8 years 3 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
ARSCOM
2004
175views more  ARSCOM 2004»
8 years 3 months ago
Circular Chromatic Number of Hypergraphs
The concept of circular chromatic number of graphs was introduced by Vince(1988). In this paper we define circular chromatic number of uniform hypergraphs and study their basic pr...
Changiz Eslahchi, Arash Rafiey
DM
2008
116views more  DM 2008»
8 years 3 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
JGT
2010
135views more  JGT 2010»
8 years 1 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...
ENDM
2006
119views more  ENDM 2006»
8 years 3 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
books