Premium
Circular chromatic number and Mycielski construction
Author(s) -
Hajiabolhassan Hossein,
Zhu Xuding
Publication year - 2003
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.10128
Subject(s) - mathematics , combinatorics , chromatic scale , integer (computer science) , graph , discrete mathematics , friendship graph , windmill graph , critical graph , graph power , computer science , line graph , programming language
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