Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

38

ARSCOM
2004

favoriteEmaildiscussreport

175views more ARSCOM 2004»

Circular Chromatic Number of Hypergraphs

13 years 10 months ago

Circular Chromatic Number of Hypergraphs

Download www.cs.sfu.ca

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 properties. We study the relationship between circular chromatic number with chromatic number and fractional chromatic number of uniform hypergraphs. Keywords : Hypergraph, Circular Coloring

Changiz Eslahchi, Arash Rafiey

Real-time Traffic

ARSCOM 2004 | Chromatic Number | Circular Chromatic Number | Uniform Hypergraphs |

claim paper

Related Content

» CPerfect KUniform Hypergraphs

» On the circular chromatic number of circular partitionable graphs

» The chromatic numbers of random hypergraphs

» On two questions about circular choosability

» Dichotomy theorems for countably infinite dimensional analytic hypergraphs

» On the chromatic number and independence number of hypergraph products

» Circular Chromatic Number and Mycielski Graphs

» Circular Chromatic Numbers of Distance Graphs with Distance Sets Missing Multiples

» The chromatic number of almost stable Kneser hypergraphs

Post Info
More Details (n/a)

Added	16 Dec 2010
Updated	16 Dec 2010
Type	Journal
Year	2004
Where	ARSCOM
Authors	Changiz Eslahchi, Arash Rafiey

Comments (0)