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

DOI10.1016/j.disc.2023.113631zbMath1522.05379OpenAlexW4385562298MaRDI QIDQ6056724

No author found.

Publication date: 4 October 2023

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

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

zbMATH Keywords

hypergraphperfect matchingcomplete \(k\)-partite graphtight Hamilton cycle

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
• Design type problems motivated by database theory
• 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
• Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs

This page was built for publication: The perfect matching and tight Hamilton cycle decomposition of complete \(n\)-balanced \(mk\)-partite \(k\)-uniform hypergraphs