Almost minimum diameter orientations of semicomplete multipartite and extended digraphs

  • Gregory Gutin
  • , Khee Meng Koh
  • , Eng Guan Tay
  • , Anders Yeo

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)

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 languageEnglish
Pages (from-to)499-506
Number of pages8
JournalGraphs and Combinatorics
Volume18
Issue number3
DOIs
Publication statusPublished - 2002
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint

Dive into the research topics of 'Almost minimum diameter orientations of semicomplete multipartite and extended digraphs'. Together they form a unique fingerprint.

Cite this