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
Star chromatic numbers of graphs
โ Scribed by Eckhard Steffen; Xuding Zhu
- Publisher
- Springer-Verlag
- Year
- 1996
- Tongue
- English
- Weight
- 555 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0209-9683
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract The starโchromatic number of a graph, a concept introduced by Vince, is natural generalization of the chromatic number of a graph. We point out an alternate definition of the starโchromatic number, which sheds new light on the relation of the starโchromatic number and the ordinary chrom
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.
## 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.
## Abstract We investigate the asymptotics of the size Ramsey number __รฎ__(__K__~1,__n__~__F__), where __K__~1,__n__~ is the __n__โstar and __F__ is a fixed graph. The author 11 has recently proved that __rฬ__(__K__~1,n~,__F__)=(1+__o__(1))__n__^2^ for any __F__ with chromatic number ฯ(__F__)=3. He