Labelling planar graphs without 4-cycles with a condition on distance two
暂无分享,去创建一个
[1] Xuding Zhu,et al. Edge-partitions of planar graphs and their game coloring numbers , 2002 .
[2] Baogang Xu,et al. The 4-Choosability of Plane Graphs without 4-Cycles' , 1999, J. Comb. Theory, Ser. B.
[3] Jan van Leeuwen,et al. lambda-Coloring of Graphs , 2000, STACS.
[4] Daphne Der-Fen Liu,et al. On L(d, 1)-labelings of graphs , 2000, Discret. Math..
[5] Ko-Wei Lih,et al. Labeling Planar Graphs with Conditions on Girth and Distance Two , 2004, SIAM J. Discret. Math..
[6] Rossella Petreschi,et al. L(h, 1)-labeling subclasses of planar graphs , 2004, J. Parallel Distributed Comput..
[7] John P. Georges,et al. Labeling Products of Complete Graphs with a Condition at Distance Two , 2001, SIAM J. Discret. Math..
[8] Wei-Fan Wang. Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers , 2006, Discret. Math..
[9] Jerrold R. Griggs,et al. Labelling Graphs with a Condition at Distance 2 , 1992, SIAM J. Discret. Math..
[10] R. Fritsch,et al. The four color theorem , 1998 .
[11] Hajo Broersma,et al. Stars and bunches in planar graphs. Part II: General planar graphs and colourings , 2002 .
[12] Mohammad R. Salavatipour,et al. A bound on the chromatic number of the square of a planar graph , 2005, J. Comb. Theory, Ser. B.
[13] G. Wegner. Graphs with given diameter and a coloring problem , 1977 .
[14] Ko-Wei Lih,et al. COLORING THE SQUARE OF AN OUTERPLANAR GRAPH , 2006 .
[15] Magnús M. Halldórsson,et al. Coloring powers of planar graphs , 2000, SODA '00.
[16] Jan van den Heuvel,et al. Coloring the square of a planar graph , 2003 .
[17] LI Shuang-cheng,et al. The L(d■,1 ■)-labeling of graphs , 2003 .
[18] Daniel Král,et al. A Theorem about the Channel Assignment Problem , 2003, SIAM J. Discret. Math..
[19] Yuriy Brun. The four-color theorem , 2002 .
[20] W. K. Hale. Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.
[21] Xuding Zhu,et al. Coloring the square of a K4-minor free graph , 2003, Discret. Math..
[22] Wei-Fan Wang. The L(2, 1)-labelling of trees , 2006, Discret. Appl. Math..
[23] Gerard J. Chang,et al. The L(2, 1)-Labeling Problem on Graphs , 1996, SIAM J. Discret. Math..
[24] Denise Sakai Troxell. Labeling Chordal Graphs: Distance Two Condition , 1994, SIAM Journal on Discrete Mathematics.
[25] Xuding Zhu,et al. Edge‐partitions of planar graphs and their game coloring numbers , 2002, J. Graph Theory.
[26] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[27] D. Gonçalves,et al. On the L(p, 1)-labelling of graphs , 2008, Discret. Math..
[28] John P. Georges,et al. On the lambda-Number of Qn and Related Graphs , 1995, SIAM J. Discret. Math..