Orthogonal double covers of complete graphs by trees of small diameter

DOI10.1016/S0166-218X(99)00087-6zbMath0932.05075WikidataQ126562905 ScholiaQ126562905MaRDI QIDQ1302170

Volker Leck, Uwe Leck

Publication date: 22 September 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

treediameterorthogonal double cover

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (6)

Orthogonal double covers of complete graphs by caterpillars of diameter 5 ⋮ More orthogonal double covers of complete graphs by Hamiltonian paths ⋮ Orthogonal double covers of \(K_{n,n}\) by small graphs. ⋮ Orthogonal double covers of general graphs. ⋮ Coding Theory Motivated by Relational Databases ⋮ Partitions with certain intersection properties

This page was built for publication: Orthogonal double covers of complete graphs by trees of small diameter