Hamilton decompositions of complete 3-uniform hypergraphs
From MaRDI portal
Publication:1336672
DOI10.1016/0012-365X(92)00572-9zbMath0805.05060MaRDI QIDQ1336672
Publication date: 28 November 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items
Packing tight Hamilton cycles in 3-uniform hypergraphs, Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs, On Hamilton cycle decompositions of \(r\)-uniform \(r\)-partite hypergraphs, The perfect matching and tight Hamilton cycle decomposition of complete \(n\)-balanced \(mk\)-partite \(k\)-uniform hypergraphs, Decomposing complete 3-uniform hypergraph K_{n}^{(3)} into 7-cycles, Unnamed Item, Spectrum of 3-uniform 6- and 9-cycle systems over \(K_v^{( 3 )} - I\), Unnamed Item, Recent advances on the Hamiltonian problem: survey III, On cyclic Hamiltonian decompositions of complete \(k\)-uniform hypergraphs, Decompositions of complete uniform hypergraphs into Hamilton Berge cycles, Unnamed Item, Large Sets of Wrapped K–K Hamilton Cycle Decompositions of Complete Bipartite 3‐Uniform Hypergraphs, Hamiltonian decompositions of complete \(k\)-uniform hypergraphs, Unnamed Item, Unnamed Item, Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs
Cites Work
