On distance two labellings of graphs

Ars Combinatoria

Volumn 47, Issue , 1997, Pages 13-22

  Liu, Daphne D F ^a   Yeh, Roger K ^b  

^a CALIFORNIA STATE UNIVERSITY   (United States)

^b FENG CHIA UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0041111017     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (10)

1. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, Northland, New York, 1976.
2. B. Bollobás, Extremal Graph Theory, Academic Press, London, 1978.
3. M.B. Cozzens and F.S. Roberts, T-colorings of graphs and the channel assignment problem, Congressus Numerantium 35 (1982), 191-280.
4. J.R. Griggs and R.K. Yeh, Labelling graphs with a condition at distance 2, SIAM J. Disc. Math. 5 (1992), 586-595.
5. G. Kant and J. van Leeuwen, The file distribution problem for processor networks, Proc. 2nd Scandinavian Workshop on Algorithm Theory (J.R. Gilbert and R. Karlson, eds.), Notes in Computer Science, 447, Springer-Verlag (1990), 48-59.
6. F. Kárteszi, Introduction to Finite Geometries, North-Holland, New York, 1976.
7. D.D.-F. Liu, T-colorings of graphs, Discrete Mathematics 101 (1992), 203-212.
8. D.D.-F. Liu, T-graphs and the channel assignment problem, Discrete Mathematics (1994), to appear.
9. F.S. Roberts, T-colorings of graphs: recent results and open problems, Discrete Mathematics 93 (1991), 229-245.
10. D. Sakai, Labelling of chordal graphs and consecutive labelling with a condition at distance two, Research Report RRR 67-91, RUTCOR, Rutgers University, New Brunswick, NJ, 1991.