Full color theorems for L(2, 1)-colorings

SIAM Journal on Discrete Mathematics

Volumn 20, Issue 2, 2006, Pages 428-443

  Fishburn, Peter C ^a   Roberts, Fred S ^b  

^a AT AND T LABS RESEARCH   (United States)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

Channel assignment problems; Distance two colorings; No hole colorings

Indexed keywords

CHANNEL ASSIGNMENT PROBLEMS; DISTANCE-TWO COLORINGS; NO-HOLE COLORINGS;

DIFFERENTIATION (CALCULUS); GRAPH THEORY; INTEGER PROGRAMMING;

THEOREM PROVING;

EID: 34249067685     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480100378562     Document Type: Article

References (10)

1. G. J. CHANG, References for L(2, 1)-Labelings, website at http://www.math.ntu.edu.tw/gjchang/courses/2005-02-graph-algorithm/2004-02-06- 121-ref-chu.pdf, accessed February 6, 2004.
2. G. J. CHANG AND D. KUO, The L(2, 1)-labeling problem on graphs, SIAM J. Discrete Math., 9 (1996), pp. 309-316.
3. P. C. FISHBURN AND F. S. ROBERTS, No-hole L(2, 1)-colorings, Discrete Appl. Math., 130 (2003), pp. 513-519.
4. J. P. GEORGES, D. W. MAURO, AND M. A. WHITTLESEY, Relating path coverings to vertex labelings with a condition at distance two, Discrete Math., 135 (1994), pp. 103-111.
5. J. R. GRIGGS AND R. K. YEH, Labelling graphs with a condition at distance 2, SIAM J. Discrete Math., 5 (1992), pp. 586-595.
6. W. K. HALE, Frequency assignment: Theory and application, Proc. IEEE, 68 (1980), pp. 1497-1514.
7. D. D.-F. LIU AND R. K. YEH, On distance two labellings of graphs, Ars Combin., 47 (1997), pp. 13-22.
8. A. PEKEČ, private communication, Fuqua School of Business, Duke University, Durham, NC, 2000.
9. F. S. ROBERTS, T-colorings of graphs: Recent results and open problems, Discrete Math., 93 (1991), pp. 229-245.
10. R. K. YEH, Labeling Graphs with a Condition at Distance Two, Ph.D. thesis, Department of Mathematics, University of South Carolina, Columbia, SC, 1990.