Sciweavers

Share
JGT
2010
79views more  JGT 2010»
8 years 1 months ago
Multi-coloring the Mycielskian of graphs
: A k-fold coloring of a graph is a function that assigns to each vertex a set of k colors, so that the color sets assigned to adjacent Contract grant sponsor: NSFC; Contract grant...
Wensong Lin, Daphne Der-Fen Liu, Xuding Zhu
EJC
2008
8 years 3 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 ...
Daphne Der-Fen Liu, Xuding Zhu
books