An Optimal Algorithm for Directing Triple Systems Using Eulerian Circuits

Janelle J. Harms, Charles J. Colbourn

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

An optimal algorithm is developed which, given an arbitrary edge-decomposition of the complete multi-graph 2λKv into copies of K3, (a triple system), produces an arc-decomposition of the complete directed multigraph λK*v into copies of the transitive tournament of order three. This algorithm is based on the well-known linear time algorithm for finding Eulerian circuits in multigraphs.

Original languageEnglish (US)
Pages (from-to)433-438
Number of pages6
JournalNorth-Holland Mathematics Studies
Volume115
Issue numberC
DOIs
StatePublished - Jan 1 1985
Externally publishedYes

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint Dive into the research topics of 'An Optimal Algorithm for Directing Triple Systems Using Eulerian Circuits'. Together they form a unique fingerprint.

  • Cite this