𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Edge-chromatic numbers of Mycielski graphs

✍ Scribed by Young Soo Kwon; Jaeun Lee; Zhongfu Zhang

Book ID
113567549
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
199 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ 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

Edge-face chromatic number and edge chro
Edge-face chromatic number and edge chromatic number of simple plane graphs
✍ Rong Luo; Cun-Quan Zhang πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 201 KB

## Abstract Given a simple plane graph __G__, an edge‐face __k__‐coloring of __G__ is a function Ο• : __E__(__G__) βˆͺ __F__(G) →  {1,…,__k__} such that, for any two adjacent or incident elements __a__, __b__ ∈ __E__(__G__) βˆͺ __F__(__G__), Ο•(__a__) ≠ ϕ(__b__). Let Ο‡~e~(__G__), Ο‡~ef~(__G__), and Ξ”(__G_

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