Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs

DOI10.1137/20M1365557zbMath1482.05244OpenAlexW4213303698MaRDI QIDQ5028355

No author found.

Publication date: 9 February 2022

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

Full work available at URL: https://doi.org/10.1137/20m1365557

zbMATH Keywords

\(k\)-uniform hypergraph\(r\)-partiteperfect matching decompositionHamilton tight cycle decomposition

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

The perfect matching and tight Hamilton cycle decomposition of complete \(n\)-balanced \(mk\)-partite \(k\)-uniform hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Hamilton cycle decompositions of \(r\)-uniform \(r\)-partite hypergraphs
• Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
• Nombres de coloration de l'hypergraphe h-parti complet
• Hamilton decompositions of complete 3-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
• Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs
• Hamiltonian chains in hypergraphs
• Handbook of Graph Theory

This page was built for publication: Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs