Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics
Reference18 articles.
1. Tiziana Calamoneri, The $$L(h,k)$$-labelling problem: an updated survey and annotated bibliography, The Computer Journal, 54 No. 8, (2011) 1344–1371.
2. Peter C. Fishburn and Fred S. Roberts, No-hole $$L(2,1)$$-colorings, Discrete Applied Mathematics 130 No. 3 (2003) 513–519.
3. Peter C. Fishburn and Fred S. Roberts, Full color theorems for $$L(2,1)$$-colorings, SIAM Journal on Discrete Mathematics 20 No. 2 (2006) 428–443.
4. Hong-Yong Fu and De Zheng Xie, Equitable $$L(2,1)$$-labelings of Sierpiński graphs, The Australasian Journal of Combinatorics 46 (2010) 147–156.
5. John P. Georges, David W. Mauro and Marshall A. Whittlesey, Relating path coverings to vertex labellings with a condition at distance two, Discrete Mathematics 135 (1994) 103–111.