L(2,1)-labeling of Hamiltonian graphs with maximum degree 3

SIAM Journal on Discrete Mathematics

Volumn 22, Issue 1, 2008, Pages 213-230

  Kang, Jeong Hyun ^a  

^a UNIVERSITY OF WEST GEORGIA   (United States)

Author keywords

Chanel assignment; Generalized coloring; Graph labeling; L(2, 1) labeling

Indexed keywords

CHANEL ASSIGNMENT; GENERALIZED COLORING; GRAPH G; GRAPH LABELING; HAMILTONIAN GRAPHS; L(2, 1)-LABELING; MAXIMUM DEGREE 3; MAXIMUM DEGREES; UV- ANDS;

COLORING; GRAPH THEORY; HAMILTONIANS;

LABELING;

EID: 57349111650     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/050632609     Document Type: Article

References (10)

1. G. J. CHANG AND D. KUO, The L(2, 1)-labelling problem on graphs, SIAM J. Discrete Math., 9 (1996), pp. 309-316.
2. Z. FÜREDI AND J.-H. KANG, L(2, 1)-Labeling and Packing of Bipartite Graphs, preprint, University of Illinois at Urbana-Champaign, 2004.
3. J. P. GEORGES AND D. W. MAURO, On generalized Petersen graphs labeled with a condition at distance two, Discrete Math., 259 (2002), pp. 311-318.
4. D. GONCALVES, On the L(p, 1)-labelling of graphs, in Discrete Math. Theoret. Comput. Sci., Proceedings of the European Conference on Combinatorics, Graph Theory, and Applications, 2005, pp. 81-86.
5. J. R. GRIGGS AND R. K. YEH, Labelling graphs with a condition at distance 2, SIAM J. Discrete Math., 5 (1992), pp. 586-595.
6. K. JONAS, Graph colorings analogues with a condition at distance two: L(2, 1)-labeling and list λ-labelings, Ph.D. thesis, Department of Mathematics, University of South Carolina, Columbia, SC, 1993.
7. J.-H. KANG, Labeling for Kneser Graph, preprint, University of Illinois at Urbana-Champaign, 2004.
8. D. KRÁL' AND R. ŠKREKOVSKI, A theorem about the channel assignment problem, SIAM J. Discrete Math., 16 (2003), pp. 426-437.
9. D. SAKAI, Labeling chordal graphs: Distance two condition, SIAM J. Discrete Math., 7 (1994), pp. 133-140.
10. n and related graphs, SIAM J. Discrete Math., 8 (1995), pp. 499-506.