๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Star chromatic numbers of some planar gr
โœ Gao, Guogang; Wang, Yiju; Zhou, Huishan ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 173 KB ๐Ÿ‘ 2 views

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 and products of g
โœ Xuding Zhu ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 666 KB

## 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 planar grap
โœ Moser, David ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 127 KB ๐Ÿ‘ 2 views

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.

The star chromatic number of a graph
โœ H. L. Abbott; B. Zhou ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 469 KB ๐Ÿ‘ 2 views

## 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.

Size ramsey numbers of stars versus 4-ch
โœ Oleg Pikhurko ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 124 KB ๐Ÿ‘ 1 views

## 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