A class of 2-colorable orthogonal double covers of complete graphs by Hamiltonian paths
From MaRDI portal
Publication:1348660
DOI10.1007/S003730200010zbMath0988.05074OpenAlexW1969243554MaRDI QIDQ1348660
Publication date: 14 May 2002
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003730200010
edge-coloringHamiltonian pathgraph decompositionorthogonal double coverself-orthogonal decomposition
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 (3)
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.
This page was built for publication: A class of 2-colorable orthogonal double covers of complete graphs by Hamiltonian paths
