Large sets of Hamilton cycle decompositions of complete bipartite 3-uniform hypergraphs

DOI10.1002/JCD.21629MaRDI QIDQ4629792zbMATH OpenOpenAlexFDO

Authors Hong-Tao Zhao

Publication date 28 March 2019

Published in Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jcd.21629

zbMATH Keywords

Hamilton cyclelarge setHamilton cycle decompositioncomplete bipartite 3-uniform hypergraph

Mathematics Subject Classification ID

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

Recommendations

• Large sets of wrapped K-K Hamilton cycle decompositions of complete bipartite 3-uniform hypergraphs
• Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs
• Decomposing complete 3-uniform hypergraphs into Hamiltonian cycles
• Hamiltonian decompositions of complete 4-partite 3-uniform hypergraphs
• Large sets of Hamilton cycle decompositions of complete bipartite graphs

Cited in

(5)

• On large sets of almost Hamilton cycle decompositions
• Large sets of Hamilton cycle decompositions of complete bipartite graphs
• Large sets of wrapped K-K Hamilton cycle decompositions of complete bipartite 3-uniform hypergraphs
• Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs
• Large sets of Hamilton cycle and path decompositions of complete bipartite graphs

This page was built for publication: Large sets of Hamilton cycle decompositions of complete bipartite 3-uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4629792)