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

Graphs with Tiny Vector Chromatic Numbers and Huge Chromatic Numbers

โœ Scribed by Feige, Uriel; Langberg, Michael; Schechtman, Gideon

Book ID
118181249
Publisher
Society for Industrial and Applied Mathematics
Year
2004
Tongue
English
Weight
381 KB
Volume
33
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Circular Chromatic Numbers and Fractiona
Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs
โœ G.J. Chang; L. Huang; X. Zhu ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 171 KB

This paper studies circular chromatic numbers and fractional chromatic numbers of distance graphs G(Z , D) for various distance sets D. In particular, we determine these numbers for those D sets of size two, for some special D sets of size three, for

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

Path chromatic numbers of graphs
Path chromatic numbers of graphs
โœ Jin Akiyama; Hiroshi Era; Severino V. Gervacio; Mamoru Watanabe ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 112 KB