Fractional chromatic number and circular
Fractional chromatic number and circular chromatic number for distance graphs with large clique size
✍
Daphne Der-Fen Liu; Xuding Zhu
📂
Article
📅
2004
🏛
John Wiley and Sons
🌐
English
⚖ 136 KB
## Abstract An Erratum has been published for this article in Journal of Graph Theory 48: 329–330, 2005. Let __M__ be a set of positive integers. The distance graph generated by __M__, denoted by __G__(__Z, M__), has the set __Z__ of all integers as the vertex set, and edges __ij__ whenever |__i__