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

Total chromatic number of generalized Mycielski graphs

โœ Scribed by Chen, Meirun; Guo, Xiaofeng; Li, Hao; Zhang, Lianzhu

Book ID
125796358
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
366 KB
Volume
334
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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