[1] Yin Xiang*, Chen Xujin, Song Zengmin,. The Circular Chromatic Number of Some Special Graphs [J]. Journal of Southeast University (English Edition), 2001, 17 (1): 73-75. [doi:10.3969/j.issn.1003-7985.2001.01.017]

Copy

The Circular Chromatic Number of Some Special Graphs()

Share：

Journal of Southeast University (English Edition)[ISSN:1003-7985/CN:32-1325/N]

Volumn:

17

Issue:

2001 1

Page:

73-75

Research Field:

Mathematics, Physics, Mechanics

Publishing date:

2001-06-30

Info

Title:

The Circular Chromatic Number of Some Special Graphs

Author(s):

Yin Xiang^1*;  Chen Xujin²;  Song Zengmin²

¹Computational Science, Nanjing University of Chemical Technology, Nanjing 210009, China
²Department of Applied Mathematics, Southeast University, Nanjing 210096, China

Keywords:

circular chromatic number;  graph C^t_k;  graph C^t_k-v;  graph H_m;  n

PACS:

O157.5

DOI:

10.3969/j.issn.1003-7985.2001.01.017

Abstract:

The circular chromatic number of a graph is a natural generalization of the chromatic number. Circular chromatic number contains more information about the structure of a graph than chromatic number does. In this paper we obtain the circular chromatic numbers of special graphs such as C^t_k and C^t_k-v, and give a simple proof of the circular chromatic number of H_{m, n}.

References:

[1] A. Vince, Star chromatic number, J. Graph Theory, vol.12, pp.551-559, 1988
[2] X. Zhu, Star chromatic numbers and products of graphs, J. Graph Theory, vol.16, pp.557-569, 1992
[3] J. A. Bondy, and P. Hell, A note on the star chromatic number, J. Graph Theory, vol.14, pp.479-482, 1990
[4] X. Zhu, Star chromatic number: a survey, Discrete Mathematics, to be published
[5] D. R. Guichard, Acyclic graph coloring and the complexity of the star chromatic number, J.Graph Theory, vol.17, pp.129-134, 1993
[6] G. Gao, Y. Wang, and H. Zhou, Star chromatic numbers of some planar graphs, J.Graph Theory, vol.27, pp.33-42, 1998

Memo

Memo:

* Born in 1964, male, master, lecturer.

Common functions