𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Star-shape, Radon number, and minty graphs

✍ Scribed by L. F. German; O. I. Topale

Publisher
Springer US
Year
1987
Tongue
English
Weight
718 KB
Volume
23
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Multichromatic numbers, star chromatic n
Multichromatic numbers, star chromatic numbers and Kneser graphs
✍ Johnson, A.; Holroyd, F. C.; Stahl, S. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 126 KB πŸ‘ 1 views

We investigate the relation between the multichromatic number (discussed by Stahl and by Hilton, Rado and Scott) and the star chromatic number (introduced by Vince) of a graph. Denoting these by Ο‡ \* and Ξ· \* , the work of the above authors shows that Ο‡ \* (G) = Ξ· \* (G) if G is bipartite, an odd cy

Star chromatic numbers and products of g
Star chromatic numbers and products of graphs
✍ 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
The star-chromatic number of planar graphs
✍ 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.

Acyclic graph coloring and the complexit
Acyclic graph coloring and the complexity of the star chromatic number
✍ David R. Guichard πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 294 KB

## Abstract Star chromatic number, introduced by A. Vince, is a natural generalization of chromatic number. We consider the question, β€œWhen is Ο‡\* < Ο‡?” We show that Ο‡\* < Ο‡ if and only if a particular digraph is acyclic and that the decisioin problem associated with this question is probably not i