On critical trees labeled with a condition at distance two

Discrete Mathematics

Volumn 295, Issue 1-3, 2005, Pages 173-189

  Troxell, Denise Sakai ^a  

^a BABSON COLLEGE   (United States)

Author keywords

Critical; ( +2) Critical tree; Distance two labeling; L(2,1) labeling; Vertex labeling

Indexed keywords

ALGORITHMS; GRAPH THEORY; INTEGRAL EQUATIONS; MATHEMATICAL TECHNIQUES; NUMERICAL ANALYSIS; PROBLEM SOLVING;

Λ-CRITICAL; (△+2)-CRITICAL TREE; DISTANCE TWO LABELING; L(2,1)-LABELING; VERTEX LABELING;

TREES (MATHEMATICS);

EID: 18544371972     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2005.02.011     Document Type: Article

References (17)

1. G.J. Chang, W. Ke, D. Kuo, D. Liu, and R.K. Yeh On L (d, 1) -labelings of graphs Discrete Math. 220 2000 57 66
2. G.J. Chang, and D. Kuo The L (2, 1) -labeling problem on graphs SIAM J. Discrete Math. 9 1996 309 316
3. P.C. Fishburn, F.S. Roberts, Full color theorems for L (2, 1) -colorings, DIMACS Technical Report 2000-08, Rutgers University, 2000.
4. P.C. Fishburn, F.S. Roberts, Minimal forbidden graphs for L (2, 1) -colorings, DIMACS Technical Report 2000-32, Rutgers University, 2000.
5. P.C. Fishburn, and F.S. Roberts No-hole L (2, 1) -colorings Discrete Applied Math. 130 2003 513 519
6. P.C. Fishburn, F.S. Roberts, L (2, 1) -colored trees of maxdegree 3 and span 5, presentation at the DIMACS/DIMATIA/Renyi Working Group on Graph Colorings and their Generalizations, DIMACS, Rutgers University, October, 2003.
7. J.P. Georges, and D.W. Mauro On the criticality of graphs labeled with a condition at distance two Congr. Numer. 101 1994 33 49
8. J.P. Georges, and D.W. Mauro Generalized vertex labelings with a condition at distance two Congr. Numer. 109 1995 141 159
9. J.P. Georges, and D.W. Mauro On the size of graphs labeled with a condition at distance two J. Graph Theory 22 1996 47 57
10. J.P. Georges, and D.W. Mauro On generalized Petersen graphs labeled with a condition at distance two Discrete Math. 259 2002 311 318
11. J.P. Georges, D.W. Mauro, and M.I. Stein Labeling products of complete graphs with a condition at distance two SIAM J. Discrete Math. 14 2000 28 35
12. 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 103 111
13. J.R. Griggs, and R.K. Yeh Labeling graphs with a condition at distance two SIAM J. Discrete Math. 5 1992 586 595
14. P.K. Jha, A. Narayanan, P. Sood, K. Sundaram, and V. Sunder On L (2, 1) -labelings of the cartesian product of a cycle and a path ARS Combinatoria 55 2000
15. D. Liu Hamiltonicity and circular distance two labellings Discrete Math. 232 2001 163 169
16. D. Sakai Labeling chordal graphs with a condition at distance two SIAM J. Discrete Math. 7 1994 133 140
17. M.A. Whittlesey, J.P. Georges, and D.W. Mauro On the λ number of Q n and related graphs SIAM J. Discrete Math. 8 1995 499 506