Orthogonal double covers of complete graphs by trees

DOI10.1007/BF03353002zbMath0885.05093MaRDI QIDQ1376062

Alexander Rosa, Ronald C. Mullin, Hans-Dietrich O. F. Gronau

Publication date: 24 March 1998

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

zbMATH Keywords

treeorthogonal double cover

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (19)

Orthogonal double covers of circulant graphs by corona product of certain infinite graph classes ⋮ New type of coding problem motivated by database theory ⋮ Orthogonal labeling for some different infinite graph classes ⋮ Orthogonal double covers of complete graphs by caterpillars of diameter 5 ⋮ On cyclic orthogonal double covers of circulant graphs by special infinite graphs ⋮ Cyclic orthogonal double covers of 4-regular circulant graphs ⋮ Embedding rainbow trees with applications to graph labelling and decomposition ⋮ General symmetric starter of orthogonal double covers of complete bipartite graph ⋮ A rainbow blow-up lemma for almost optimally bounded edge-colourings ⋮ Orthogonal double covers of \(K_{n,n}\) by small graphs. ⋮ Orthogonal double covers of general graphs. ⋮ On Hering decomposition of DK\(_n\) induced by group actions on conjugacy classes ⋮ TWO-FOLD FACTORIZATION OF THE COMPLETE BIPARTITE GRAPHS BY INFINITE GRAPH CLASSES ⋮ A complete classification of 5-regular circulant graphs that allow cyclic orthogonal double covers ⋮ Orthogonal decomposition and packing of complete graphs ⋮ Partitions with certain intersection properties ⋮ Extended Petersen graphs ⋮ Cyclic Orthogonal Double Covers of Circulants by Certain Nerve Cell Graphs. ⋮ Self-orthogonal decompositions of graphs into matchings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum matrix representation of closure operations
• Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions
• A class of self-orthogonal 2-sequencings
• Self-orthogonal Hamilton path decompositions
• On a problem of Hering concerning orthogonal covers of \({\mathbf K}_ n\)
• On minimum matrix representation of closure operations
• Block Designs with Cyclic Block Structure
• Bipartite labelings of trees and the gracesize
• On orthogonal double covers of k_n and a conjecture of chung and west

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