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
โฆ LIBER โฆ
Degree Sequences and Chromatic Numbers of Graphs
โ Scribed by Narong Punnim
- Publisher
- Springer Japan
- Year
- 2002
- Tongue
- English
- Weight
- 106 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Circular Chromatic Numbers and Fractiona
โ
G.J. Chang; L. Huang; X. Zhu
๐
Article
๐
1998
๐
Elsevier Science
๐
English
โ 171 KB
Hadwiger number and chromatic number for
โ
Neil Robertson; Zi-Xia Song
๐
Article
๐
2009
๐
John Wiley and Sons
๐
English
โ 105 KB
## Abstract We consider a problem related to Hadwiger's Conjecture. Let __D__=(__d__~1~, __d__~2~, โฆ, __d__~__n__~) be a graphic sequence with 0โฉฝ__d__~1~โฉฝ__d__~2~โฉฝยทยทยทโฉฝ__d__~__n__~โฉฝ__n__โ1. Any simple graph __G__ with __D__ its degree sequence is called a realization of __D__. Let __R__[__D__] denot
Path chromatic numbers of graphs
โ
Jin Akiyama; Hiroshi Era; Severino V. Gervacio; Mamoru Watanabe
๐
Article
๐
1989
๐
John Wiley and Sons
๐
English
โ 112 KB
Chromatic numbers of competition graphs
โ
J.Richard Lundgren; Sarah K. Merz; Craig W. Rasmussen
๐
Article
๐
1995
๐
Elsevier Science
๐
English
โ 964 KB
Star chromatic numbers of graphs
โ
Eckhard Steffen; Xuding Zhu
๐
Article
๐
1996
๐
Springer-Verlag
๐
English
โ 555 KB
Bounds on the Generalised Acyclic Chroma
โ
Catherine Greenhill; Oleg Pikhurko
๐
Article
๐
2005
๐
Springer Japan
๐
English
โ 143 KB