354 search results - page 1 / 71 » The Chromatic Number Of Graph Powers |
CPC
2002
13 years 5 months ago
2002
ARSCOM
2004
13 years 5 months ago
2004
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...
SODA
2000
ACM
13 years 6 months ago
2000
ACM
We give nontrivial bounds for the inductiveness or degeneracy of power graphs Gk of a planar graph G. This implies bounds for the chromatic number as well, since the inductiveness ...
DM
2008
13 years 5 months ago
2008
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 ...
EJC
2008
13 years 5 months ago
2008
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 ...