Fixed-parameter complexity of λ-labelings
Top Cited Papers
- 30 September 2001
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 113 (1) , 59-72
- https://doi.org/10.1016/s0166-218x(00)00387-5
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Frequency assignment in mobile and radio networksPublished by American Mathematical Society (AMS) ,1998
- Covering Regular GraphsJournal of Combinatorial Theory, Series B, 1997
- The $L(2,1)$-Labeling Problem on GraphsSIAM Journal on Discrete Mathematics, 1996
- On the size of graphs labeled with a condition at distance twoJournal of Graph Theory, 1996
- On the $\lambda$-Number of $Q_n $ and Related GraphsSIAM Journal on Discrete Mathematics, 1995
- Algorithms for Square Roots of GraphsSIAM Journal on Discrete Mathematics, 1995
- Relating path coverings to vertex labellings with a condition at distance twoDiscrete Mathematics, 1994
- Regular codes in regular graphs are difficultDiscrete Mathematics, 1994
- Labeling Chordal Graphs: Distance Two ConditionSIAM Journal on Discrete Mathematics, 1994
- Labelling Graphs with a Condition at Distance 2SIAM Journal on Discrete Mathematics, 1992