On 2-factorizations of the complete 3-uniform hypergraph of order 12 minus a 1-factor
From MaRDI portal
Publication:6616838
DOI10.1007/978-3-031-52969-6_28zbMATH Open1548.05261MaRDI QIDQ6616838
Saad I. El-Zanati, P. Adams, Author name not available (Why is that?), Peter Florido
Publication date: 9 October 2024
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A complete solution to the two-table Oberwolfach problems
- On Hamilton cycle decompositions of \(r\)-uniform \(r\)-partite hypergraphs
- Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
- Practical graph isomorphism. II.
- Eine Lösung der beiden Heffterschen Differenzenprobleme.
- On factorisations of complete graphs into circulant graphs and the Oberwolfach problem
- Hamilton cycle decompositions of \(k\)-uniform \(k\)-partite hypergraphs
- On bipartite 2-factorizations of kn − I and the Oberwolfach problem
This page was built for publication: On 2-factorizations of the complete 3-uniform hypergraph of order 12 minus a 1-factor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6616838)
