The concept of the star chromatic number of a graph was introduced by Vince (A. Vince, Star chromatic number, J. Graph Theory 12 (1988), 551--559), which is a natural generalization of the chromatic number of a graph. This paper calculates the star chromatic numbers of three infinite families of pla
The Star Chromatic Numbers of Some Planar Graphs Derived from Wheels
β Scribed by De Ming Li
- Book ID
- 106280089
- Publisher
- Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
- Year
- 2002
- Tongue
- English
- Weight
- 150 KB
- Volume
- 18
- Category
- Article
- ISSN
- 1439-7617
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The star-chromatic number of a graph, a parameter introduced by Vince, is a natural generalization of the chromatic number of a graph. Here we construct planar graphs with star-chromatic number r, where r is any rational number between 2 and 3, partially answering a question of Vince.
We investigate the notion of the star chromatic number of a graph in conjunction with various other graph parameters, among them, clique number, girth, and independence number. 1997 Academic Press /\*(G)=inf { m d : G has an (m, d )&coloring = . article no. TB961738 245 0095-8956Γ97 25.00
## Abstract We study a generalization of the notion of the chromatic number of a graph in which the colors assigned to adjacent vertices are required to be, in a certain sense, far apart. Β© 1993 John Wiley & Sons, Inc.