Edge labelings with a condition at distance two

Ars Combinatoria

Volumn 70, Issue , 2004, Pages 109-128

  Georges, John P ^a   Mauro, David W ^a  

^a TRINITY COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 26844481888     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. G. J. Chang, Wen-Tsai Ke, D. Kuo, D. Liu, R. Yeh, On L(d,1)-labelings of graphs, Discrete Mathematics, 220 (2000) 57-66.
2. G. J. Chang and D. Kuo, The L(2, 1)-labeling problem on graphs, SIAM J. Discrete Math., 9 (1996) 309-316.
3. G.A. Dirac, Some theorems on abstract graphs, Proc. London. Math. Soc., (1952) 69-81.
4. S. Fiorini and R.J. Wilson, Edge-colourings of graphs, Research Notes in Mathematics No. 16, Pitman, (London, 1977).
5. J.P. Georges and D.W. Mauro, On regular graphs optimally labeled with a condition at distance two, submitted
6. J.P. Georges and D.W. Mauro, Labeling trees with a condition at distance two, submitted
7. j,k-numbers of products of complete graphs, Congressus Numerantium, 140 (1999) 141-160.
8. J.P. Georges and D.W. Mauro, On the size of graphs labeled with a condition at distance two, Jour. of Graph Theory, 22 (1996) 47-57.
9. J.P. Georges and D.W. Mauro, Generalized vertex labelings with a condition at distance two, Congressus Numerantium, 109 (1995) 141-159.
10. J.P. Georges and D.W. Mauro, and M.A. Whittlesey, Relating path coverings to vertex labelings with a condition at distance two, Discrete Math., 135 (1994) 103-111.
11. J.P. Georges and D.W. Mauro, On the criticality of graphs labeled with a condition at distance two, Congressus Numerantium, 101 (1994) 33-49.
12. J.P. Georges, D.W. Mauro and M.I. Stein, Labeling products of complete graphs with a condition at distance two, SIAM J. Discrete Math., 14 (2000) 28-35.
13. J.R. Griggs and R.K. Yeh, Labeling graphs with a condition at distance two, SIAM J. Discrete Math., 5 (1992) 586-595.
14. W.K Hale, Frequency assignment: theory and application, Proc. IEEE 68 (1980) 1497-1514.
15. P. Jha, Optimal L(2, 1)-labeling of Kronecker products of certain cycles, preprint
16. P. Jha, A. Narayanan, P. Sood, K. Sundaram, and V. Sunder, L(2, 1)-labeling of the Cartesian product of a cycle and a path, Ars Combinatoria, 55 (2000) 81-89.
17. D. Liu and R. Yeh, On distance two labelings of graphs, Ars Combinatoria 47 (1997) 13-22
18. D. Sakai, Labeling chordal graphs: distance two condition. SIAM J. Discrete Math. 7 (1994) 133-140.
19. J. Van Den Heuvel, R.A. Leese and M.A. Shepherd, Graph labeling and radio channel assignment, Jour. of Graph Theory 29 (1998) 263-283.
20. n and related graphs, SIAM J. Discrete Math. 8 (1995) 499-506.