Skip to main content
Article thumbnail
Location of Repository

Orthogonal Decompositions of Complete Digraphs

By Sven Hartmann


A family G of isomorphic copies of a given digraph ~ G is said to be an orthogonal decomposition of the complete digraph ~ D n by ~ G, if every arc of ~ D n belongs to exactly two members of G and the union of any two different elements from G contains precisely one pair of reverse arcs. Given a digraph ~ H, an ~ H-family m ~ H is the vertex-disjoint union of m copies of ~ H. In this paper, we consider orthogonal decompositions by ~ H-families. Our objective is to prove the existence of such an orthogonal decomposition whenever certain necessary conditions hold and m is sufficiently large

Year: 1998
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.