L(j,k)- and circular L(j,k)-labellings for the products of complete graphs
暂无分享,去创建一个
[1] Jerrold R. Griggs,et al. Labelling Graphs with a Condition at Distance 2 , 1992, SIAM J. Discret. Math..
[2] Danilo Korze,et al. L(2, 1)-labeling of strong products of cycles , 2005, Inf. Process. Lett..
[3] Gerard J. Chang,et al. The L(2, 1)-Labeling Problem on Graphs , 1996, SIAM J. Discret. Math..
[4] J. V. D. Heuvel,et al. Graph labeling and radio channel assignment , 1998 .
[5] John P. Georges,et al. Labeling Products of Complete Graphs with a Condition at Distance Two , 2001, SIAM J. Discret. Math..
[6] John P. Georges,et al. On the lambda-Number of Qn and Related Graphs , 1995, SIAM J. Discret. Math..
[7] Roger K. Yeh,et al. LABELLING GRAPHS WITH THE CIRCULAR DIFFERENCE , 2000 .
[8] Aleksander Vesel,et al. Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2, 1)-colorings and independence numbers , 2003, Discret. Appl. Math..
[9] Xuding Zhu,et al. Circulant Distant Two Labeling and Circular Chromatic Number , 2003, Ars Comb..
[10] Denise Sakai,et al. Labeling Chordal Graphs: Distance Two Condition , 1994 .
[11] John P. Georges,et al. Labeling trees with a condition at distance two , 2003, Discret. Math..
[12] P. K. Jha. Optimal L(2,1)-labeling of Cartesian products of cycles, with an application to independent domination , 2000 .
[13] W. K. Hale. Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.
[14] P. K. Jha. Optimal L(2, 1)-labeling of strong products of cycles [transmitter frequency assignment] , 2001 .
[15] John P. Georges,et al. Relating path coverings to vertex labellings with a condition at distance two , 1994, Discret. Math..
[16] Daphne Der-Fen Liu. Hamiltonicity and circular distance two labellings , 2001, Discret. Math..
[17] Pranava K. Jha,et al. On L(2, 1)-labeling of the Cartesian product of a cycle and a path , 2000, Ars Comb..