Sciweavers

JCT
2010
70views more  JCT 2010»
13 years 10 months ago
Graphs with bounded tree-width and large odd-girth are almost bipartite
We prove that for every k and every ε > 0, there exists g such that every graph with tree-width at most k and odd-girth at least g has circular chromatic number at most 2 + ε...
Alexandr V. Kostochka, Daniel Král', Jean-S...
ARSCOM
2004
175views more  ARSCOM 2004»
13 years 11 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
ENDM
2007
111views more  ENDM 2007»
13 years 11 months ago
Claw-free circular-perfect graphs
The circular chromatic number of a graph is a well-studied refinement of the chromatic number. Circular-perfect graphs is a superclass of perfect graphs defined by means of this...
Arnaud Pêcher, Xuding Zhu
JGT
2006
99views more  JGT 2006»
13 years 11 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
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
DM
2008
112views more  DM 2008»
13 years 11 months ago
Coloring the Cartesian sum of graphs
For graphs G and H, let G H denote their Cartesian sum. This paper investigates the chromatic number and the circular chromatic number for GH. It is proved that (G H) max{ c(G)...
Daphne Der-Fen Liu, Xuding Zhu