Decomposing complete 3-uniform hypergraphs into Hamiltonian cycles
From MaRDI portal
Recommendations
- Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
- Decomposing complete 3-uniform hypergraph \(k_n^{(3)}\) into 7-cycles
- Decomposing the complete 3-uniform hypergraphs \(k_n^{(3)}\) into Hamiltonian cycles
- Hamilton decomposition of complete 3-uniform hypergraphs
- Large sets of wrapped K-K Hamilton cycle decompositions of complete bipartite 3-uniform hypergraphs
Cited in
(35)- Hamilton decompositions of complete 3-uniform hypergraphs
- A possible analogue of -labellings for 3-uniform hypergraphs
- Edge orbits and cyclic and \(r\)-pyramidal decompositions of complete uniform hypergraphs
- Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs
- On cyclic Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
- Decompositions of complete uniform hypergraphs into Hamilton Berge cycles
- Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs
- On tight 6-cycle decompositions of complete 3-uniform hypergraphs
- Decomposing complete 3-uniform hypergraphs into cycles
- Hamilton cycle decompositions of k-uniform k-partite hypergraphs
- Decomposing the complete 3-uniform hypergraphs \(k_n^{(3)}\) into Hamiltonian cycles
- Hamiltonian decompositions of prisms over complete 3-uniform hypergraphs
- On Hamilton cycle decompositions of r-uniform r-partite hypergraphs
- 4-cycle decompositions of complete 3-uniform hypergraphs
- Large sets of Hamilton cycle decompositions of complete bipartite 3-uniform hypergraphs
- On tight 9-cycle decompositions of complete 3-uniform hypergraphs
- Perfect matching and Hamilton tight cycle decomposition of complete n-balanced r-partite k-uniform hypergraphs
- scientific article; zbMATH DE number 7640248 (Why is no real title available?)
- On maximum packings of \(\lambda \)-fold complete 3-uniform hypergraphs with triple-hyperstars of size 4
- Hamiltonian decompositions of complete 4-partite 3-uniform hypergraphs
- Decomposing complete 3-uniform hypergraph \(k_n^{(3)}\) into 7-cycles
- Maximum packings of the \(\lambda\)-fold complete 3-uniform hypergraph with loose 3-cycles
- scientific article; zbMATH DE number 7283879 (Why is no real title available?)
- Hamilton decomposition of complete 3-uniform hypergraphs
- Large sets of wrapped K-K Hamilton cycle decompositions of complete bipartite 3-uniform hypergraphs
- The perfect matching and tight Hamilton cycle decomposition of complete n-balanced mk-partite k-uniform hypergraphs
- scientific article; zbMATH DE number 7731175 (Why is no real title available?)
- Spectrum of 3-uniform 6- and 9-cycle systems over \(K_v^{( 3 )} - I\)
- On Hamiltonian decompositions of complete 3-uniform hypergraphs
- On decompositions of complete 3-uniform hypergraphs into a linear forest with 4 edges
- A note on Hamilton -cycle decomposition of complete k-partite hypergraphs
- Hypercycle systems from semi-parallel classes
- The spectrum problem for the 4-uniform 4-colorable 3-cycles with maximum degree 2
- Hamiltonian decompositions of complete \(k\)-uniform hypergraphs
- On tight 6-cycle decompositions of complete 3-uniform multi-hypergraphs
This page was built for publication: Decomposing complete 3-uniform hypergraphs into Hamiltonian cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3059012)
