The $L(2,1)$-Labeling Problem on Graphs
- 1 May 1996
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 9 (2) , 309-316
- https://doi.org/10.1137/s0895480193245339
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Relating path coverings to vertex labellings with a condition at distance twoDiscrete Mathematics, 1994
- Further Results on T-Coloring and Frequency Assignment ProblemsSIAM Journal on Discrete Mathematics, 1994
- Labelling Graphs with a Condition at Distance 2SIAM Journal on Discrete Mathematics, 1992
- T-colorings of graphs: recent results and open problemsDiscrete Mathematics, 1991
- Pair Labellings with Given DistanceSIAM Journal on Discrete Mathematics, 1989
- A Linear Recognition Algorithm for CographsSIAM Journal on Computing, 1985
- Covering, Packing and Generalized PerfectionSIAM Journal on Algebraic Discrete Methods, 1985
- The k-Domination and k-Stability Problems on Sun-Free Chordal GraphsSIAM Journal on Algebraic Discrete Methods, 1984
- Characterizations of strongly chordal graphsDiscrete Mathematics, 1983
- Frequency assignment: Theory and applicationsProceedings of the IEEE, 1980