A class of 2-colorable orthogonal double covers of complete graphs by Hamiltonian paths

DOI10.1007/S003730200010zbMATH Open0988.05074OpenAlexW1969243554MaRDI QIDQ1348660FDOQ1348660

Authors: Uwe Leck 

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

Recommendations

• More orthogonal double covers of complete graphs by Hamiltonian paths
• Orthogonal double covers of complete bipartite graphs by paths and cycles
• Orthogonal double covers of complete bipartite graphs
• Orthogonal double covers of \(K_{n,n}\) by small graphs.
• Orthogonal double covers of general graphs.

zbMATH Keywords

Hamiltonian pathedge-coloringgraph decompositionorthogonal double coverself-orthogonal decomposition

Mathematics Subject Classification ID

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

Cited In (4)

• Orthogonal double covers of general graphs.
• Double coverings of 2‐paths by Hamilton cycles*
• Orthogonal double covers of \(K_{n,n}\) by small graphs.
• More orthogonal double covers of complete graphs by Hamiltonian paths

This page was built for publication: A class of 2-colorable orthogonal double covers of complete graphs by Hamiltonian paths

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