L ( 2, 1 )-labelings of Cartesian products of two cycles

Discrete Applied Mathematics

Volumn 154, Issue 10, 2006, Pages 1522-1540

  Schwarz, Christopher ^a   Troxell, Denise Sakai ^b  

^a UNIVERSITY OF MASSACHUSETTS   (United States)

^b BABSON COLLEGE   (United States)

Author keywords

Distance two labeling; L ( 2, 1 ) coloring; L ( 2, 1 ) labeling; Product of cycles; Vertex labeling

Indexed keywords

INTEGER PROGRAMMING; NUMERICAL ANALYSIS; NUMERICAL METHODS;

DISTANCE TWO LABELING; L ( 2, 1 )-COLORING; L ( 2, 1 )-LABELING; PRODUCT OF CYCLES; VERTEX LABELING;

GRAPH THEORY;

EID: 33646136881     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.12.006     Document Type: Article

References (24)

1. Chang G.J., and Kuo D. The L ( 2, 1 )-labeling problem on graphs. SIAM J. Discrete Math. 9 (1996) 309-316
2. Chang G.J., Ke W., Kuo D., Liu D., and Yeh R.K. On L ( d, 1 )-labelings of graphs. Discrete Math. 220 (2000) 57-66
3. P.C. Fishburn, F.S. Roberts, Full color for L ( 2, 1 )-colorings, DIMACS Technical Report 2000-08, Rutgers University, 2000.
4. P.C. Fishburn, F.S. Roberts, Minimal forbidden graphs for L ( 2, 1 )-colorings, DIMACS Technical Report 2000-32, Rutgers University, 2000.
5. Fishburn P.C., and Roberts F.S. No-hole L ( 2, 1 )-colorings. Discrete Appl. Math. 130 (2003) 513-519
6. Georges J.P., and Mauro D.W. On the criticality of graphs labeled with a condition at distance two. Congr. Numer. 101 (1994) 33-49
7. Georges J.P., and Mauro D.W. Generalized vertex labelings with a condition at distance two. Congr. Numer. 109 (1995) 141-159
8. Georges J.P., and Mauro D.W. On the size of graphs labeled with a condition at distance two. J. Graph Theory 22 (1996) 47-57
9. j-numbers of the products of complete graphs. Congr. Numer. 140 (1999) 141-160
10. Georges J.P., and Mauro D.W. On generalized Petersen graphs labeled with a condition at distance two. Discrete Math. 259 (2002) 311-318
11. Georges J.P., Mauro D.W., and Stein M.I. Labeling products of complete graphs with a condition at distance two. SIAM J. Discrete Math. 14 (2000) 28-35
12. Georges J.P., Mauro D.W., and Whittlesey M.A. Relating path coverings to vertex labelings with a condition at distance two. Discrete Math. 135 (1994) 103-111
13. Griggs J.R., and Yeh R.K. Labeling graphs with a condition at distance two. SIAM J. Discrete Math. 5 (1992) 586-595
14. Jha P.K. Optimal L ( 2, 1 )-labeling of Cartesian products of cycles, with an application to independent domination. IEEE Trans. Circuits and Syst.-I 47 10 (2000) 1531-1534
15. Jha P.K., Narayanan A., Sood P., Sundaram K., and Sunder V. On L ( 2, 1 )-labelings of the Cartesian product of a cycle and a path. Ars Combin. 55 (2000)
16. Jha P.K., Klavžar S., and Vesel A. Optimal L ( 2, 1 )-labelings of certain direct products of cycles and Cartesian products of cycles. Discrete Appl. Math. 152 (2005) 257-265
17. Klavžar S., and Vesel A. Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of ( 2, 1 )-colorings and independence numbers. Discrete Appl. Math. 129 (2003) 449-460
18. Liu D. Hamiltonicity and circular distance two labellings. Discrete Math. 232 (2001) 163-169
19. Liu D., and Yeh R.K. On distance two labelings of graphs. Ars Combin. 47 (1997) 13-22
20. Raychaudhuri A. Distance-2 labeling of strongly chordal graphs. Congr. Numer. 149 (2001) 55-63
21. Raychaudhuri A. A note on distance-k labeling and kth powers of graphs. Congr. Numer. 144 (2000) 89-95
22. Sakai D. Labeling chordal graphs with a condition at distance two. SIAM J. Discrete Math. 7 (1994) 133-140
23. Troxell D.S. On critical trees labeled with a condition at distance two. Discrete Math. 295 (2005) 173-189
24. n and related graphs. SIAM J. Discrete Math. 8 (1995) 499-506