On Hamilton cycle decompositions of \(r\)-uniform \(r\)-partite hypergraphs

DOI10.1016/j.disc.2013.09.011zbMath1278.05163OpenAlexW2089266060MaRDI QIDQ393157

Michael William Schroeder

Publication date: 16 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.09.011

zbMATH Keywords

hypergraphHamilton chainHamilton decomposition

Mathematics Subject Classification ID

Hypergraphs (05C65) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (10)

On maximum packings of λ-fold complete 3-uniform hypergraphs with triple-hyperstars of size 4 ⋮ Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs ⋮ The perfect matching and tight Hamilton cycle decomposition of complete \(n\)-balanced \(mk\)-partite \(k\)-uniform hypergraphs ⋮ Maximum packings of the λ-fold complete 3-uniform hypergraph with loose 3-cycles ⋮ Unnamed Item ⋮ Decompositions of complete uniform hypergraphs into Hamilton Berge cycles ⋮ Edge orbits and cyclic and \(r\)-pyramidal decompositions of complete uniform hypergraphs ⋮ Unnamed Item ⋮ Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs ⋮ Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
• Hamilton decompositions of complete 3-uniform hypergraphs
• Hamiltonian chains in hypergraphs
• Handbook of Graph Theory

This page was built for publication: On Hamilton cycle decompositions of \(r\)-uniform \(r\)-partite hypergraphs