Self-orthogonal Hamilton path decompositions

DOI10.1016/0012-365X(91)90441-4zbMath0780.05035OpenAlexW1983858973MaRDI QIDQ1183991

J. D. Horton, Gillian M. Nonay

Publication date: 28 June 1992

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

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90441-4

zbMATH Keywords

decompositionHamilton pathscomplete multigraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Related Items (8)

Biquadratic residues and self-orthogonal 2-sequencings ⋮ Orthogonal double covers of complete graphs by trees ⋮ 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. ⋮ Construction of Hamilton path tournament designs ⋮ On Hering decomposition of DK\(_n\) induced by group actions on conjugacy classes ⋮ A class of self-orthogonal 2-sequencings

Cites Work

• Unnamed Item
• Edge partitions of the complete symmetric directed graph and related designs
• Decomposition of the complete directed graph into k-circuits
• Block Designs with Cyclic Block Structure

This page was built for publication: Self-orthogonal Hamilton path decompositions