论文信息 - Circular chromatic number and Mycielski construction

Circular chromatic number and Mycielski construction

This paper gives a sufficient condition for a graph G to have its circular chromatic number equal 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 ≥ n χc(M (Kk)) = χ(M (Kk)).

Xuding Zhu | Hossein Hajiabolhassan | Xuding Zhu | H. Hajiabolhassan

[1] Jan Mycielski. Sur le coloriage des graphs , 1955 .

[2] Lingling Huang,et al. The circular chromatic number of the Mycielskian of G , 1999, J. Graph Theory.

[3] XUDING ZHU,et al. Star chromatic numbers of graphs , 1996, Comb..

[4] Bing Zhou,et al. The star chromatic number of a graph , 1993, J. Graph Theory.

[5] Pavol Hell,et al. A note on the star chromatic number , 1990, J. Graph Theory.

[6] Xuding Zhu,et al. Circular chromatic number: a survey , 2001, Discret. Math..

[7] A. Vince,et al. Star chromatic number , 1988, J. Graph Theory.

[8] Bojan Mohar,et al. The circular chromatic number of a digraph , 2004, J. Graph Theory.

[9] Michael Larsen,et al. The fractional chromatic number of mycielski's graphs , 1995, J. Graph Theory.

[10] David C. Fisher,et al. Fractional colorings with large denominators , 1995, J. Graph Theory.

[11] Xuding Zhu. Star chromatic numbers and products of graphs , 1992, J. Graph Theory.

[12] Genghua Fan,et al. Circular Chromatic Number and Mycielski Graphs , 2004, Comb..

[13] Xuding Zhu. Graphs Whose Circular Chromatic Number Equals the Chromatic Number , 1999, Comb..

[14] David R. Guichard,et al. Acyclic graph coloring and the complexity of the star chromatic number , 1993, J. Graph Theory.

[15] Xuding Zhu,et al. Uniquely H -colorable graphs with large girth , 1996 .