论文信息 - An analogue of Hajós’ Theorem for the circular chromatic number

An analogue of Hajós’ Theorem for the circular chromatic number

This paper designs a set of graph operations and proves that starting from Gd , by repeatedly applying these operations, one can construct all graphs G with χc(G) ≥ k/d (for k/d ≥ 3). This can be viewed as an analogue of Hajós’ Theorem for the circular chromatic number.

Xuding Zhu

[1] Xuding Zhu. Planar Graphs with Circular Chromatic Numbers between 3 and 4 , 1999, J. Comb. Theory, Ser. B.

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

[3] Xuding Zhu. A simple proof of Moser's theorem , 1999, J. Graph Theory.

[4] János Pach. Graphs whose every independent set has a common neighbour , 1981, Discret. Math..

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

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

[7] Ryan B. Hayward,et al. Weakly triangulated graphs , 1985, J. Comb. Theory B.

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

[9] David Moser,et al. The star-chromatic number of planar graphs , 1997, J. Graph Theory.

[10] Jaroslav Nešetřil,et al. The Homomorphism Structure of Classes of Graphs , 1999, Combinatorics, Probability and Computing.

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

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

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

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