𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graphs Whose Circular Chromatic Number Equals the Chromatic Number

✍ Scribed by Xuding Zhu

Publisher
Springer-Verlag
Year
1999
Tongue
English
Weight
206 KB
Volume
19
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Graphs whose choice number is equal to t
Graphs whose choice number is equal to their chromatic number
✍ Gravier, Sylvain; Maffray, FrοΏ½dοΏ½ric πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 219 KB

A graph G is k-choosable if it admits a vertex-coloring whenever the colors allowed at each vertex are restricted to a list of length k. If Ο‡ denotes the usual chromatic number of G, we are interested in which kind of G is Ο‡-choosable. This question contains a famous conjecture, which states that ev

Circular Chromatic Numbers and Fractiona
Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs
✍ G.J. Chang; L. Huang; X. Zhu πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 171 KB

This paper studies circular chromatic numbers and fractional chromatic numbers of distance graphs G(Z , D) for various distance sets D. In particular, we determine these numbers for those D sets of size two, for some special D sets of size three, for

On the circular chromatic number of circ
On the circular chromatic number of circular partitionable graphs
✍ Arnaud PΓͺcher; Xuding Zhu πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 168 KB

## Abstract This article studies the circular chromatic number of a class of circular partitionable graphs. We prove that an infinite family of circular partitionable graphs __G__ has $\chi\_ c (G) = \chi(G)$. A consequence of this result is that we obtain an infinite family of graphs __G__ with th

The circular chromatic number of series-
The circular chromatic number of series-parallel graphs
✍ Hell, Pavol; Zhu, Xuding πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 238 KB πŸ‘ 2 views

In this article, we consider the circular chromatic number Ο‡ c (G) of series-parallel graphs G. It is well known that series-parallel graphs have chromatic number at most 3. Hence, their circular chromatic numbers are at most 3. If a seriesparallel graph G contains a triangle, then both the chromati

Fractional chromatic number and circular
Fractional chromatic number and circular chromatic number for distance graphs with large clique size
✍ Daphne Der-Fen Liu; Xuding Zhu πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 136 KB

## Abstract An Erratum has been published for this article in Journal of Graph Theory 48: 329–330, 2005. Let __M__ be a set of positive integers. The distance graph generated by __M__, denoted by __G__(__Z, M__), has the set __Z__ of all integers as the vertex set, and edges __ij__ whenever |__i__