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 set, and two vertices x and y are adjacent whenever |x-y|@?D. For integers 1

[1]  J. H. Rabinowitz,et al.  An Asymptotic Approach to the Channel Assignment Problem , 1985 .

[2]  Xuding Zhu,et al.  Distance Graphs and T-Coloring , 1999, J. Comb. Theory B.

[3]  Peter Che Bor Lam,et al.  Coloring of distance graphs with intervals as distance sets , 2005, Eur. J. Comb..

[4]  Margit Voigt,et al.  Chromatic Number of Prime Distance Graphs , 1994, Discret. Appl. Math..

[5]  Wensong Lin,et al.  Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs with Distance Sets Missing An Interval , 2004, Ars Comb..

[6]  Basil Gordon,et al.  Sequences of Integers with Missing Differences , 1973, J. Comb. Theory A.

[7]  Peter Che Bor Lam,et al.  Circular chromatic numbers of some distance graphs , 2005, Discret. Math..

[8]  Jerrold R. Griggs The Channel Assigment Problem for Mutually Adjacent Sites , 1994, J. Comb. Theory, Ser. A.

[9]  Xuding Zhu,et al.  Fractional chromatic number and circular chromatic number for distance graphs with large clique size , 2004, J. Graph Theory.

[10]  Arnfried Kemnitz,et al.  Chromatic numbers of integer distance graphs , 2001, Discret. Math..

[11]  Xuding Zhu Circular chromatic number of distance graphs with distance sets of cardinality 3 , 2002, J. Graph Theory.

[12]  Margit Voigt,et al.  Colouring of distance graphs , 1999, Ars Comb..

[13]  Paul Erdös,et al.  Colouring the real line , 1985, J. Comb. Theory B.

[14]  Xuding Zhu Circular chromatic number of distance graphs with distance sets of cardinality 3 , 2002 .

[15]  Gerard J. Chang,et al.  Integral distance graphs , 1997 .

[16]  Xuding Zhu,et al.  Distance graphs with missing multiples in the distance sets , 1999 .

[17]  Xuding Zhu,et al.  Distance graphs with missing multiples in the distance sets , 1999, J. Graph Theory.

[18]  Arnfried Kemnitz,et al.  Coloring of integer distance graphs , 1998, Discret. Math..

[19]  Soma Gupta,et al.  Sets of Integers with Missing Differences , 2000, J. Comb. Theory A.

[20]  Xuding Zhu,et al.  Circular chromatic numbers of a class of distance graphs , 2003, Discret. Math..

[21]  Xuding Zhu,et al.  Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs , 1998, Eur. J. Comb..

[22]  Paul Erdös,et al.  Colouring prime distance graphs , 1990, Graphs Comb..

[23]  Daphne Der-Fen Liu T-Colorings and Chromatic Number of Distance Graphs , 2000, Ars Comb..