Abstract.
An orientation of a digraph D is a spanning subdigraph of D obtained from D by deleting exactly one arc between x and y for every pair x≠y of vertices such that both x y and y x are in D. Almost minimum diameter orientations of certain semicomplete multipartite and extended digraphs are considered, several generalizations of results on orientations of undirected graphs are obtained, some conjectures are posed.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: August 31, 2000 Final version received: October 30, 2001
Acknowledgments. Part of this work was done when the first author was visiting the Department of Mathematics, National University of Singapore. The departmental hospitality and financial support are very much appreciated.
Rights and permissions
About this article
Cite this article
Gutin, G., Koh, K., Tay, E. et al. Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs. Graphs Comb 18, 499–506 (2002). https://doi.org/10.1007/s003730200036
Issue Date:
DOI: https://doi.org/10.1007/s003730200036