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)
05C65: Hypergraphs
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C45: Eulerian and Hamiltonian graphs
Related Items
Unnamed Item, Unnamed Item, Unnamed Item, Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs, Decomposing complete 3-uniform hypergraph K_{n}^{(3)} into 7-cycles, Unnamed Item, Unnamed Item, Large Sets of Wrapped K–K Hamilton Cycle Decompositions of Complete Bipartite 3‐Uniform Hypergraphs, The perfect matching and tight Hamilton cycle decomposition of complete \(n\)-balanced \(mk\)-partite \(k\)-uniform hypergraphs, On Hamilton cycle decompositions of \(r\)-uniform \(r\)-partite hypergraphs, Hamiltonian decompositions of complete \(k\)-uniform hypergraphs, 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, Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs, Packing tight Hamilton cycles in 3-uniform hypergraphs
Cites Work
