Multiple L(j,1)-labeling of the triangular lattice
暂无分享,去创建一个
[1] Tiziana Calamoneri,et al. The L(h, k)-Labelling Problem: An Updated Survey and Annotated Bibliography , 2011, Comput. J..
[2] Jerrold R. Griggs,et al. Labelling Graphs with a Condition at Distance 2 , 1992, SIAM J. Discret. Math..
[3] Tiziana Calamoneri,et al. Optimal L(h, k)-Labeling of Regular Grids , 2006, Discret. Math. Theor. Comput. Sci..
[4] J. V. D. Heuvel,et al. Graph labeling and radio channel assignment , 1998 .
[5] Xuding Zhu,et al. Circulant Distant Two Labeling and Circular Chromatic Number , 2003, Ars Comb..
[6] Wensong Lin,et al. On n-fold L(j, k)-and circular L(j, k)-labelings of graphs , 2012, Discret. Appl. Math..
[7] W. K. Hale. Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.
[8] Wensong Lin,et al. Multicoloring and Mycielski construction , 2008, Discret. Math..
[9] Wang Dong. Radio channel assignment , 2000 .
[10] Steven D. Noble,et al. Cyclic Labellings with Constraints at Two Distances , 2004, Electron. J. Comb..
[11] Roger K. Yeh. A survey on labeling graphs with a condition at distance two , 2006, Discret. Math..
[12] Roger K. Yeh,et al. LABELLING GRAPHS WITH THE CIRCULAR DIFFERENCE , 2000 .
[13] S. Stahl. n-Tuple colorings and associated graphs , 1976 .
[14] Saverio Caminiti,et al. New bounds for the L(h, k) number of regular grids , 2006 .
[15] David S. Johnson,et al. Two Results Concerning Multicoloring , 1978 .
[16] S. Stahl,et al. Multichromatic numbers, star chromatic numbers and Kneser graphs , 1997 .
[17] Jerrold R. Griggs,et al. Optimal channel assignments for lattices with conditions at distance two , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.
[18] Daphne Der-Fen Liu. Hamiltonicity and circular distance two labellings , 2001, Discret. Math..
[19] Jerrold R. Griggs,et al. Recent progress in mathematics and engineering on optimal graph labellings with distance conditions , 2007, J. Comb. Optim..
[20] Daphne Der-Fen Liu,et al. Multi-coloring the Mycielskian of graphs , 2010 .
[21] Peter Che Bor Lam,et al. L(j,k)- and circular L(j,k)-labellings for the products of complete graphs , 2007, J. Comb. Optim..