Sciweavers

20 search results - page 1 / 4
» Circular Chromatic Number of Hypergraphs
Sort
View
ARSCOM
2004
175views more  ARSCOM 2004»
13 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
ARSCOM
2006
132views more  ARSCOM 2006»
13 years 11 months ago
C-Perfect K-Uniform Hypergraphs
In this paper we define the concept of clique number of uniform hypergraph and study its relationship with circular chromatic number and clique number. For every positive integer ...
Changiz Eslahchi, Arash Rafiey
JGT
2006
99views more  JGT 2006»
13 years 10 months ago
On the circular chromatic number of circular partitionable graphs
This paper studies the circular chromatic number of a class of circular partitionable graphs. We prove that an infinite family of circular partitionable graphs have
Arnaud Pêcher, Xuding Zhu
RSA
1998
105views more  RSA 1998»
13 years 10 months ago
The chromatic numbers of random hypergraphs
: For a pair of integers 1F␥-r, the ␥-chromatic number of an r-uniform Ž .hypergraph Hs V, E is the minimal k, for which there exists a partition of V into subsets < <T ...
Michael Krivelevich, Benny Sudakov
JGT
2008
75views more  JGT 2008»
13 years 11 months ago
On two questions about circular choosability
Abstract. We answer two questions of Zhu on circular choosability of graphs. We show that the circular list chromatic number of an even cycle is equal to 2 and give an example of a...
Serguei Norine