Sciweavers

Share
EJC
2008

Fractional chromatic number of distance graphs generated by two-interval sets

8 years 2 months ago
Fractional chromatic number of distance graphs generated by two-interval sets
Let D be a set of positive integers. The distance graph generated by D, denoted by G(Z, D), has the set Z of all integers as the vertex Supported in part by the National Science Foundation under grant DMS 0302456. Supported in part by the National Science Council, R. O. C., under grant NSC94
Daphne Der-Fen Liu, Xuding Zhu
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2008
Where EJC
Authors Daphne Der-Fen Liu, Xuding Zhu
Comments (0)
books