Circulant Distant Two Labeling and Circular Chromatic Number
暂无分享,去创建一个
[1] Xuding Zhu,et al. Star-extremal graphs and the lexicographic product , 1996, Discret. Math..
[2] G. Chang,et al. Labeling graphs with a condition at distance two , 2005 .
[3] A. Vince,et al. Star chromatic number , 1988, J. Graph Theory.
[4] John P. Georges,et al. Relating path coverings to vertex labellings with a condition at distance two , 1994, Discret. Math..
[5] John P. Georges,et al. On the lambda-Number of Qn and Related Graphs , 1995, SIAM J. Discret. Math..
[6] Roger K. Yeh,et al. LABELLING GRAPHS WITH THE CIRCULAR DIFFERENCE , 2000 .
[7] W. K. Hale. Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.
[8] Daphne Der-Fen Liu,et al. On Distance Two Labellings of Graphs , 1997, Ars Comb..
[9] Jerrold R. Griggs,et al. Labelling Graphs with a Condition at Distance 2 , 1992, SIAM J. Discret. Math..
[10] J. V. D. Heuvel,et al. Graph labeling and radio channel assignment , 1998 .
[11] Gerard J. Chang,et al. The L(2, 1)-Labeling Problem on Graphs , 1996, SIAM J. Discret. Math..
[12] Daphne Der-Fen Liu,et al. On L(d, 1)-labelings of graphs , 2000, Discret. Math..