Hamiltonicity and circular distance two labellings

Discrete Mathematics

Volumn 232, Issue 1-3, 2001, Pages 163-169

  Liu, Daphne Der Fen ^a  

^a CALIFORNIA STATE UNIVERSITY   (United States)

Author keywords

Hamiltonicity; L(2, 1) labelling; Path covering number; Vertex labelling

Indexed keywords

EID: 0035815451     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(00)00299-5     Document Type: Article

References (6)

1. G.J. Chang, D. Kuo, The L(2, 1)-labeling problem on graphs, SIAM J. Disc. Math. 9 (1996) 309-316.
2. V. Chvátal, On Hamilton's ideals, J. Combin. Theory Ser. B. 12 (1972) 163-168.
3. J. Georges, D. Mauro, M. Whittlesey, Relating path covering to vertex labelings with a condition at distance two, Disc. Math. 135 (1994) 103-111.
4. J.R. Griggs, R.K. Yeh, Labeling graphs with a condition at distance 2, SIAM J. Discrete Math. 5 (1992) 586-595.
5. W.K. Hale, Frequency assignment: Theory and applications, Proc. IEEE 68 (1980) 1497-1514.
6. J. van den Heuvel, R.A. Leese, M.A. Shepherd, Graph labelling and radio channel assignment, J. Graph Theory 29 (1998) 263-283.