Orthogonal double covers of complete graphs by trees of small diameter

DOI10.1016/S0166-218X(99)00087-6zbMATH Open0932.05075WikidataQ126562905 ScholiaQ126562905MaRDI QIDQ1302170FDOQ1302170

Authors: Uwe Leck, Volker Leck 

Publication date: 22 September 1999

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

Recommendations

• On orthogonal double covers by trees
• Orthogonal double covers of complete graphs by lobsters of diameter 4
• Orthogonal double covers of complete graphs by trees
• Orthogonal double covers of complete graphs by fat caterpillars
• Orthogonal double covers of complete graphs by caterpillars of diameter 5

zbMATH Keywords

treediameterorthogonal double cover

Mathematics Subject Classification ID

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

Cited In (10)

• Coding theory motivated by relational databases
• Orthogonal double covers of complete graphs by caterpillars of diameter 5
• Orthogonal double covers of complete graphs by trees
• Orthogonal double covers of general graphs.
• Orthogonal double covers of complete graphs by fat caterpillars
• Orthogonal double covers of complete graphs by lobsters of diameter 4
• Title not available (Why is that?)
• Orthogonal double covers of \(K_{n,n}\) by small graphs.
• Partitions with certain intersection properties
• More orthogonal double covers of complete graphs by Hamiltonian paths

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

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