๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

CIRCULAR CHROMATIC NUMBER AND MYCIELSKI GRAPHS

โœ Scribed by Hongmei Liu

Book ID
108422279
Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
433 KB
Volume
26
Category
Article
ISSN
0252-9602

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))

Edge-chromatic numbers of Mycielski grap
Edge-chromatic numbers of Mycielski graphs
โœ Young Soo Kwon; Jaeun Lee; Zhongfu Zhang ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 199 KB
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