The L(2, 1)-labeling problem on graphs

SIAM Journal on Discrete Mathematics

Volumn 9, Issue 2, 1996, Pages 309-316

  Chang, Gerard J ^a   Kuo, David ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Algorithm; Bipartite matching; Chordal graph; Join; L(2, 1) labeling; Perfect graph; T coloring; Tree; Union

Indexed keywords

ALGORITHMS;

BIPARTITE GRAPH; GRAPH COLOURING; GRAPH DEGREE; GRAPH LABELLING; POLYNOMIAL TIME;

GRAPH THEORY;

EID: 0030367240     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480193245339     Document Type: Article

References (21)

1. G. J. CHANG AND G. L. NEMHAUSER (1984), The k-domination and k-stability problems on sun-free chordal graphs, SIAM J. Alg. Disc. Meth., 5, pp. 332-345.
2. _ (1985), Covering, packing and generalized perfection, SIAM J. Alg. Disc. Meth., 6, pp. 109-132.
3. D. G. CORNEIL, Y. PERL, AND L. K. STEWART (1985), A linear recognition algorithm for cographs, SIAM J. Comput., 14, pp. 926-934.
4. M. B. COZZENS AND F. S. ROBERTS (1982), T-Colorings of graphs and the channel assignment problem, Congr. Numer., 35, pp. 191-208.
5. M. B. COZZENS AND D. I. WANG (1984), The general channel assignment problem, Congr. Numer., 41, pp. 115-129.
6. M. FARBER (1983), Characterization of strongly chordal graphs, Discrete Math., 43, pp. 173-189.
7. Z. FÜREDI, J. R. GRIGGS, AND D. J. KLEITMAN (1989), Pair labelings with given distance, SIAM J. Discrete Math., 2, pp. 491-499.
8. J. GEORGES, D. MAURO, AND M. WHITTLESEY (1994), Relating path covering to vertex labellings with a condition at distance two, Discrete Math., 135, pp. 103-111.
9. M. C. GOLUMBIC (1980), Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York.
10. J. R. GRIGGS AND R. K. YEH (1992), Labeling graphs with a condition at distance 2, SIAM J. Discrete Math., 5, pp. 586-595.
11. W. K. HALE (1980), Frequency assignment: Theory and applications, in Proc. IEEE, 68, pp. 1497-1514.
12. K. JONAS (1993), Graph Coloring Analogues With a Condition at Distance Two: L(2, 1)-Labelings and List λ-Labelings, Ph.D. thesis, Dept. of Math., University of South Carolina, Columbia, SC.
13. A. RAYCHAUDHURI (1985), Intersection Assignment, T-Coloring and Powers of Graphs, Ph.D. thesis, Dept. of Math., Rutgers University, New Brunswick, NJ.
14. _, Further results on T-coloring and frequency assignment problems, submitted.
15. F. S. ROBERTS (1988), private communication to J. R. Griggs.
16. _ (1990), Prom garbage to rainbows: Generalizations of graph colorings and their applications, in Proc. of the Sixth International Conference on the Theory and Applications of Graphs, Y. Alavi, G. Chartrand, O. R. Oellermann, and A. J. Schwenk, eds., John Wiley, New York.
17. _ (1991), T-colorings of graphs: Recent results and open problems, Discrete Math., 93, pp. 229-245.
18. D. SAKAI (1994), Labeling chordal graphs: Distance two condition, SIAM J. Discrete Math., 7, pp. 133-140.
19. B. TESMAN (1989), T-Colorings, List T-Colorings, and Set T-Colorings of Graphs, Ph.D. thesis, Dept. of Math., Rutgers University, New Brunswick, NJ.
20. n and related graphs, SIAM J. Discrete Math., 8, pp. 499-506.
21. R. K. YEH (1990), Labeling Graphs with a Condition at Distance Two, Ph.D. thesis, Dept. of Math., University of South Carolina, Columbia, SC.