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 k,p and q, 2q p we construct a k-uniform hypergraph H with small clique number whose circular chromatic number equals p q . We define the concept and study the properties of c-perfect k-uniform hypergraphs . Keywords : Hypergraph, Circular Coloring, c-Perfect Hypergraph

• Type: Journal
• Year: 2006
• Where: ARSCOM
• Authors: Changiz Eslahchi, Arash Rafiey
• Keywords: ARSCOM 2006, Circular Chromatic Number, Clique Number, Hypergraph