We discuss relationships among T-colorings of graphs and chromatic numbers, fractional chromatic numbers, and circular chromatic numbers of distance graphs. We first prove that for any finite integral set T that contains 0, the asymptotic T-coloring ratio R(T ) is equal to the fractional chromatic n
β¦ LIBER β¦
The distance coloring of graphs
β Scribed by Lian Ying Miao,Yi Zheng Fan
- Book ID
- 126348133
- Publisher
- Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
- Year
- 2014
- Tongue
- English
- Weight
- 258 KB
- Volume
- 30
- Category
- Article
- ISSN
- 1439-7617
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Distance Graphs andT-Coloring
β
Gerard J Chang; Daphne D.-F Liu; Xuding Zhu
π
Article
π
1999
π
Elsevier Science
π
English
β 126 KB
Coloring of integer distance graphs
β
Arnfried Kemnitz; Halka Kolberg
π
Article
π
1998
π
Elsevier Science
π
English
β 488 KB
Pattern Periodic Coloring of Distance Gr
β
Xuding Zhu
π
Article
π
1998
π
Elsevier Science
π
English
β 250 KB
Suppose D is a subset of Z. The distance graph G(Z, D) with distance set D is the graph with vertex set Z and two vertices x, y are adjacent if |x& y| # D. We introduce a coloring method for distance graphs, the pattern periodic coloring, and we shall compare this method with other general coloring
2-distance coloring of sparse graphs
β
Marthe Bonamy; Benjamin LΓ©vΓͺque; Alexandre Pinlou
π
Article
π
2011
π
Elsevier Science
π
English
β 189 KB
Distance-two coloring of sparse graphs
β
DvoΕΓ‘k, ZdenΔk; Esperet, Louis
π
Article
π
2014
π
Elsevier Science
π
English
β 387 KB
List 2-distance coloring of planar graph
β
Bu, Yuehua; Yan, Xiaoyan
π
Article
π
2014
π
Springer US
π
English
β 327 KB