✦ LIBER ✦

Circular Chromatic Number and Mycielski Graphs

✍ Scribed by Genghua Fan

Publisher: Springer-Verlag
Year: 2004
Tongue: English
Weight: 173 KB
Volume: 24
Category: Article
ISSN: 0209-9683
DOI: 10.1007/s00493-004-0008-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Circular chromatic number and Mycielski

Circular chromatic number and Mycielski construction

✍ Hossein Hajiabolhassan; Xuding Zhu 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB

## Abstract This paper gives a sufficient condition for a graph __G__ to have its circular chromatic number equal to its chromatic number. By using this result, we prove that for any integer __t__ ≥ 1, there exists an integer __n__ such that for all $k \ge n, \chi \_c (M^t(K\_k))\,= \chi(M^t(K\_k))

The fractional chromatic number of mycie

The fractional chromatic number of mycielski's graphs

✍ Michael Larsen; James Propp; Daniel Ullman 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 236 KB

The most familiar construction of graphs whose clique number is much smaller than their chromatic number is due to Mycielski, who constructed a sequence G, of triangle-free graphs with ,y(G,) = n. In this article, w e calculate the fractional chromatic number of G, and show that this sequence of num

Graphs Whose Circular Chromatic Number E

Graphs Whose Circular Chromatic Number Equals the Chromatic Number

✍ Xuding Zhu 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 206 KB

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

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__