HAMILTONIAN DECOMPOSITIONS OF COMPLETE 4-PARTITE 3-UNIFORM HYPERGRAPHS
Keywords:
Hamiltonian decomposition, Uniform hypergraph, Multipartite hypergraph
Abstract
Based on the definition of Hamiltonian cycles given by Katona and Kierstead, we provide a construction of Hamiltonian decompositions of the complete 4-partite 3-uniform hypergraph K(3) 4(2m) , where 2m is the size of each partite set.
Published
2022-06-16
Section
Articles