Sciweavers

COMBINATORICS
1998
103views more  COMBINATORICS 1998»
14 years 5 days ago
Recognizing Circulant Graphs of Prime Order in Polynomial Time
A circulant graph G of order n is a Cayley graph over the cyclic group Zn. Equivalently, G is circulant iff its vertices can be ordered such that the corresponding adjacency matr...
Mikhail E. Muzychuk, Gottfried Tinhofer
DM
2008
116views more  DM 2008»
14 years 16 days 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