Sciweavers

Share
ARSCOM
2004
175views more  ARSCOM 2004»
9 years 10 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
2010
85views more  DM 2010»
9 years 10 months ago
Hamiltonian decompositions of complete k-uniform hypergraphs
Using a generalisation of Hamiltonian cycles to uniform hypergraphs due to Katona and Kierstead, we define a new notion of a Hamiltonian decomposition of a uniform hypergraph. We ...
Robert F. Bailey, Brett Stevens
books