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

• Type: Journal
• Year: 2008
• Where: EJC
• Authors: Daphne Der-Fen Liu, Xuding Zhu
• Keywords: Distance Graph, EJC 2007, EJC 2008, Information Technology, National Science, Positive Integers