The minimum diameter of orientations of complete multipartite graphs

Graphs and Combinatorics

Volumn 12, Issue 4, 1996, Pages 333-339

  Koh, K M ^a   Tan, B P ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012914772     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf01858466     Document Type: Article

References (8)

1. Boesch, F., Tindell, R.: Robbins's theorem for mixed multigraphs. Amer. Math. Monthly, 87, 716-719 (1980)
2. Chvátal, V., Thomassen, C.: Distances in orientation of graphs. J. Combinat. Theory Ser B, 24, 61-75 (1978)
3. Gutin, G.: Minimizing and Maximizing the Diameter in Orientations of Graphs. Graphs and Combinatorics, 10, 225-230 (1994)
4. Koh, K.M., Tan, B.P.: The diameter of an orientation of a complete multipartite graph. Discrete Math. (in press)
5. Maurer, S.B.: The king chicken theorems. Math. Mag. 53, 67-80 (1980)
6. Reid, K.B.: Every vertex a king. Discrete Math. 38, 93-98 (1982)
7. Robbins, H.: A theorem on graphs with an application to a problem of traffic control. Amer. Math. Monthly, 46, 281-283 (1939)
8. Soltes, L.: Orientations of graphs minimizing the radius or the diameter. Math Slovaca 36, 289-296 (1986)