Optimal packing of even circuits into a \(\text{DK}_ v\)
From MaRDI portal
Publication:1918209
DOI10.1016/0378-3758(95)00095-XzbMath0856.05076MaRDI QIDQ1918209
Publication date: 17 February 1997
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Related Items (2)
Coverings and packings of complete directed graphs by odd circuits ⋮ Packings of the complete directed graph with \(m\)-circuits
Cites Work
- A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Decomposition of the complete directed graph into k-circuits
- Packings and coverings of the complete directed multigraph with 3- and 4-circuits
- An application of the solution of Kirkman's schoolgirl problem: The decomposition of the symmetric oriented complete graph into 3-circuits
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Optimal packing of even circuits into a \(\text{DK}_ v\)
