On Hamiltonian decompositions of complete 3-uniform hypergraphs

DOI10.1016/j.disc.2024.114197zbMATH Open1547.05243MaRDI QIDQ6611741

Chariya Uiyyasathian, Chutima Saengchampa

Publication date: 27 September 2024

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

zbMATH Keywords

Hamiltonian decompositioncomplete uniform hypergraphcomplete multipartite hypergraph

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
• Unnamed Item
• Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
• Hamiltonian decompositions of complete graphs
• A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
• Decomposition of the complete directed graph into k-circuits
• The edge-coloring of complete hypergraphs. I
• Hamilton decompositions of complete 3-uniform hypergraphs
• Hamiltonian decomposition of complete tripartite 3-uniform hypergraphs
• Extremal problems for cycles in graphs
• Hamiltonian Decompositions of Graphs, Directed Graphs and Hypergraphs
• Hamiltonian chains in hypergraphs
• 1‐rotational k‐factorizations of the complete graph and new solutions to the Oberwolfach problem
• Hamiltonian decomposition of complete bipartite \(r\)-hypergraphs

This page was built for publication: On Hamiltonian decompositions of complete 3-uniform hypergraphs