Orthogonal decompositions of complete digraphs

DOI10.1007/S003730200021MaRDI QIDQ1606031zbMATH OpenOpenAlexFDO

Authors Sven Hartmann

Publication date 29 July 2002

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s003730200021

zbMATH Keywords

orthogonal decompositiondigraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Asymptotic results on suborthogonal \(\overrightarrow{\mathfrak G}\)-decompositions of complete digraphs
• Orthogonal \(H\)-decompositions.
• Orthogonal factorizations of digraphs
• Discussions on orthogonal factorizations in digraphs
• A generalization of orthogonal factorizations in digraphs

Cited in

(5)

• Orthogonal decomposition and packing of complete graphs
• On a problem of Hering concerning orthogonal covers of \({\mathbf K}_ n\)
• Orthogonal double covers of general graphs.
• Orthocomplemented complete lattices and graphs
• Orthogonal \(H\)-decompositions.

This page was built for publication: Orthogonal decompositions of complete digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1606031)