论文信息 - Circular perfect graphs

Circular perfect graphs

For 1 ≤ d ≤ k, let Kk/d be the graph with vertices 0, 1, · · · , k − 1, in which i ∼ j if d ≤ |i − j| ≤ k − d. The circular chromatic number χc(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to Kk/d. The circular clique number ωc(G) of G is the maximum of those k/d for which Kk/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G we have χc(H) = ωc(H). This paper surveys results on circular perfect graphs.

Xuding Zhu

[1] Xuding Zhu,et al. Circular colouring and graph homomorphism , 1999, Bulletin of the Australian Mathematical Society.

[2] Xuding Zhu,et al. Recent Developments in Circular Colouring of Graphs , 2006 .

[3] Xuding Zhu,et al. Three classes of minimal circular-imperfect graphs , 2005, Electron. Notes Discret. Math..

[4] Xuding Zhu,et al. Density of the circular chromatic numbers of series-parallel graphs , 2004, J. Graph Theory.

[5] Xuding Zhu. Circular perfect graphs , 2005 .

[6] Xuding Zhu. An analogue of Hajós’ Theorem for the circular chromatic number , 2001 .

[7] Xuding Zhu. Perfect Graphs for Generalized Colouring-Circular Perfect Graphs , 2001, Graphs, Morphisms and Statistical Physics.

[8] Manfred W. Padberg,et al. Perfect zero–one matrices , 1974, Math. Program..

[9] L. Lovász. A Characterization of Perfect Graphs , 1972 .

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

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

[12] Xuding Zhu. An Analogue of Hajós' Theorem for the Circular Chromatic Number (II) , 2003, Graphs Comb..

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