Dudeney's round table problem
From MaRDI portal
Recommendations
Cites work
- Exact coverings of 2-paths by 4-cycles
- scientific article; zbMATH DE number 3677839 (Why is no real title available?)
- scientific article; zbMATH DE number 3478938 (Why is no real title available?)
- scientific article; zbMATH DE number 3485843 (Why is no real title available?)
- scientific article; zbMATH DE number 3276424 (Why is no real title available?)
- Some new perfect one-factorizations from starters in finite fields
Cited in
(12)- Exact coverings of 2-paths by Hamilton cycles
- A solution of Dudeney's round table problem for an even number of people
- Compatible Hamilton decompositions of directed wrapped butterfly graphs
- Pairwise compatible Hamilton decompositions of K_n
- Decompositions of line graphs of complete graphs into paths and cycles
- Black 1-factors and Dudeney sets
- scientific article; zbMATH DE number 1109419 (Why is no real title available?)
- Double coverings of 2‐paths by Hamilton cycles*
- scientific article; zbMATH DE number 1833077 (Why is no real title available?)
- Covering 2-paths uniformly
- Dudeney's round table problem and neighbour-balanced Hamilton decompositions
- On Kotzig's perfect set problem of Hamiltonian cycle decompositions of the complete graph
This page was built for publication: Dudeney's round table problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1182929)