1. G. J. Chang and D. Kuo, The L(2, 1)-labeling problem on graphs, SIAM J. Discrete Math., 9 (1996), pp. 309–316.
2. P. Damaschke, J. S. Deogun, D. Kratsch, and G. Steiner, Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm, Order, 8 (1992), pp. 383–391.
3. Lect Notes Comput Sci;L. Engebretsen,2003
4. Lect Notes Comput Sci;J. Fiala,2001
5. Lect Notes Comput Sci;D. A. Fotakis,2004