On the Size of Graphs Labeled with a Condition at Distance Two

Journal of Graph Theory

Volumn 22, Issue 1, 1996, Pages 47-57

  Georges, John P ^a   Mauro, David W ^a  

^a TRINITY COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030555034     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(199605)22:1<47::AID-JGT7>3.0.CO;2-L     Document Type: Article

References (12)

1. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications. North Holland, New York (1976).
2. G. J. Chang and D. Kuo, The L(2,1)-labeling problem on graphs. SIAM J. Discrete Math. Submitted.
3. V. Chvàtal, On Hamilton's ideals. J. Combinat. Theory B 12 (1972) 163-168.
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) 103-111.
5. J. R. Griggs and R. K. Yeh, Labeling graphs with a condition at distance two. SIAM J. Discrete Math. 5 (1992) 586-595.
6. W. K. Hale, Frequency assignment: Theory and application. Proc. IEEE 68 (1980) 1497-1514.
7. K. Jonas, Ph.D. thesis, University of South Carolina (1993).
8. O. Ore, Are coverings of graphs. Ann. Mat. Pura Appl. 55 (1961) 315-322.
9. F. S. Roberts, From garbage to rainbows: Generalizations of graph coloring and their applications. Proceedings of the Sixth International Conference on Theory and Applications of Graphs. Wiley, New York (1990).
10. F S. Roberts, T-colorings of graphs: Recent results and open problems. Discrete Math. 93 (1991) 229-245.
11. D. Sakai, Labeling chordal graphs: Distance two condition. SIAM J. Discrete Math. 7 (1994) 133-140.
12. n and related graphs. SIAM J. Discrete Math. to appear.