L(j, k)-Labelings and L(j, k)-Edge-Labelings of Graphs
暂无分享,去创建一个
[1] W. K. Hale. Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.
[2] John P. Georges,et al. Labeling Products of Complete Graphs with a Condition at Distance Two , 2001, SIAM J. Discret. Math..
[3] William T. Trotter,et al. Induced matchings in cubic graphs , 1993, J. Graph Theory.
[4] John P. Georges,et al. Edge Labelings with a Condition at Distance Two , 2004, Ars Comb..
[5] Jerrold R. Griggs,et al. Labelling Graphs with a Condition at Distance 2 , 1992, SIAM J. Discret. Math..