✦ LIBER ✦

Circular chromatic number and Mycielski construction

✍ Scribed by Hossein Hajiabolhassan; Xuding Zhu

Publisher: John Wiley and Sons
Year: 2003
Tongue: English
Weight: 94 KB
Volume: 44
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.10128

No coin nor oath required. For personal study only.

✦ Synopsis

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))$. © 2003 Wiley Periodicals, Inc. J Graph Theory 44: 106–115, 2003

📜 SIMILAR VOLUMES

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

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

Circular chromatic number of subgraphs

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

## Abstract This paper proves that every (__n__ + )‐chromatic graph contains a subgraph __H__ with $\chi \_c (H) = n$. This provides an easy method for constructing sparse graphs __G__ with $\chi\_c (G) = \chi ( G) = n$. It is also proved that for any ε > 0, for any fraction __k/d__ > 2, there exis

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__

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 a digra

The circular chromatic number of a digraph

✍ Drago Bokal; Gas̆per Fijavz; Martin Juvan; P. Mark Kayll; Bojan Mohar 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB 👁 1 views

## Abstract We introduce the circular chromatic number χ~__c__~ of a digraph and establish various basic results. They show that the coloring theory for digraphs is similar to the coloring theory for undirected graphs when independent sets of vertices are replaced by acyclic sets. Since the directe