论文信息 - Multi-coloring the Mycielskian of graphs

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 number: 10671033 (to W.L.); Contract grant sponsor: National Science Foundation; Contract grant number: DMS 0302456 (to D.D.L.); Contract grant sponsor: National Science Council; Contract grant number: NSC95-2115-M-110-013-MY3 (to X.Z.). Journal of Graph Theory 2009 Wiley Periodicals, Inc.

Xuding Zhu | Daphne Der-Fen Liu | Wensong Lin

[1] E. Weisstein. Kneser's Conjecture , 2002 .

[2] C. Berge. Fractional Graph Theory , 1978 .

[3] Xuding Zhu,et al. Star-extremal graphs and the lexicographic product , 1996, Discret. Math..

[4] Claude Tardif,et al. Fractional chromatic numbers of cones over graphs , 2001, J. Graph Theory.

[5] Michael Larsen,et al. The fractional chromatic number of mycielski's graphs , 1995, J. Graph Theory.

[6] Xuding Zhu,et al. Recent Developments in Circular Colouring of Graphs , 2006 .

[7] A. Schrijver,et al. Vertex-critical subgraphs of Kneser-graphs , 1978 .

[8] Xuding Zhu,et al. Circular chromatic number: a survey , 2001, Discret. Math..

[9] László Lovász,et al. Kneser's Conjecture, Chromatic Number, and Homotopy , 1978, J. Comb. Theory A.

[10] Wensong Lin,et al. Multicoloring and Mycielski construction , 2008, Discret. Math..