More orthogonal double covers of complete graphs by Hamiltonian paths
From MaRDI portal
Publication:2427509
DOI10.1016/j.disc.2007.05.026zbMath1152.05020MaRDI QIDQ2427509
Uwe Leck, Sven Hartmann, Volker Leck
Publication date: 13 May 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.05.026
05C38: Paths and cycles
05B15: Orthogonal arrays, Latin squares, Room squares
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A class of self-orthogonal 2-sequencings
- Self-orthogonal Hamilton path decompositions
- Orthogonal double covers of complete graphs by trees of small diameter
- A class of 2-colorable orthogonal double covers of complete graphs by Hamiltonian paths
- Orthogonal double covers by super-extendable cycles
- Block Designs with Cyclic Block Structure
- On orthogonal double covers of graphs