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 xy and yx 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.
| Original language | English |
|---|---|
| Pages (from-to) | 499-506 |
| Number of pages | 8 |
| Journal | Graphs and Combinatorics |
| Volume | 18 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 2002 |
| Externally published | Yes |
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics