Pages that link to "Item:Q1207764"
From MaRDI portal
The following pages link to A solution of Dudeney's round table problem for an even number of people (Q1207764):
Displaying 7 items.
- Partitioning de Bruijn graphs into fixed-length cycles for robot identification and tracking (Q313805) (← links)
- Exact coverings of 2-paths by Hamilton cycles (Q1193580) (← links)
- Compatible Hamilton decompositions of directed wrapped butterfly graphs (Q1283804) (← links)
- Pairwise compatible Hamilton decompositions of \(K_n\) (Q1364230) (← links)
- Uniform coverings of 2-paths with 5-paths in the complete graph (Q2568483) (← links)
- Double coverings of 2‐paths by Hamilton cycles* (Q4537566) (← links)
- Covering 2-paths uniformly (Q4948740) (← links)