scientific article; zbMATH DE number 847840

MaRDI QIDQ4866876zbMATH OpenFDO

Authors Hirotoshi Honma

Publication date 22 May 1996

zbMATH Keywords

complete hypergraphdecompositionHamiltonian problemhyper-Hamiltonian cycles

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

• Hamilton decomposition of complete 3-uniform hypergraphs
• Hamilton decompositions of complete 3-uniform hypergraphs
• Hamiltonian decomposition of complete tripartite 3-uniform hypergraphs
• Decomposing the complete 3-uniform hypergraphs \(k_n^{(3)}\) into Hamiltonian cycles
• Hamiltonian decompositions of complete \(k\)-uniform hypergraphs

Cited in

(2)

• Hamilton decompositions of complete 3-uniform hypergraphs
• Decomposing complete 3-uniform hypergraphs into cycles

This page was built for publication:

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