Exact coverings of 2-paths by Hamilton cycles
From MaRDI portal
Publication:1193580
DOI10.1016/0097-3165(92)90011-IzbMath0754.05026OpenAlexW2083484318MaRDI QIDQ1193580
Gisaku Nakamura, Midori Kobayashi
Publication date: 27 September 1992
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(92)90011-i
Paths and cycles (05C38) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Double coverings of 2‐paths by Hamilton cycles*, Pairwise compatible Hamilton decompositions of \(K_n\), Covering 2-paths uniformly, Resolvable coverings of 2-paths by 4-cycles, A solution of Dudeney's round table problem for an even number of people
Cites Work
- A perfect one-factorization of \(K_{36}\)
- Exact coverings of 2-paths by 4-cycles
- Dudeney's round table problem
- A solution of Dudeney's round table problem for an even number of people
- Parallel concepts in graph theory
- Symmetry groups of some perfect 1-factorizations of complete graphs
- Unnamed Item
- Unnamed Item