Graph labellings with variable weights, a survey
Authors:
- Jerrold R. GriggsJGJerrold R. Griggs
- Daniel Král’DKDaniel Král’
- 1 June 2009
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 157 (12) , 2646-2658
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Labeling planar graphs with a condition at distance twoEuropean Journal of Combinatorics, 2007
- Labeling trees with a condition at distance twoDiscrete Mathematics, 2006
- The L(h, k)-Labelling Problem: A Survey and Annotated BibliographyThe Computer Journal, 2006
- New bounds for the L(h, k) number of regular gridsInternational Journal of Mobile Network Design and Innovation, 2006
- Graph distance‐dependent labeling related to code assignment in computer networksNaval Research Logistics (NRL), 2005
- An exact algorithm for the channel assignment problemDiscrete Applied Mathematics, 2005
- Approximations for -Colorings of GraphsThe Computer Journal, 2004
- Labeling trees with a condition at distance twoDiscrete Mathematics, 2003
- Channel assignment with separation for interference avoidance in wireless networksIEEE Transactions on Parallel and Distributed Systems, 2003
- Code assignment for hidden terminal interference avoidance in multihop packet radio networksIEEE/ACM Transactions on Networking, 1995