Large Sets of Wrapped K–K Hamilton Cycle Decompositions of Complete Bipartite 3‐Uniform Hypergraphs
From MaRDI portal
Publication:5744160
DOI10.1002/jcd.21423zbMath1331.05130OpenAlexW1583291491MaRDI QIDQ5744160
Publication date: 17 February 2016
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.21423
Related Items
Cites Work
- Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
- Large sets of Hamilton cycle decompositions of complete bipartite graphs
- Hamilton decompositions of complete 3-uniform hypergraphs
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Cycle decompositions III: Complete graphs and fixed length cycles
- On the construction of odd cycle systems
- Hamiltonian chains in hypergraphs
- Cycle decompositions of complete multigraphs
- Hamiltonian decomposition of complete bipartite \(r\)-hypergraphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item