scientific article
From MaRDI portal
Publication:3059012
zbMath1207.05133MaRDI QIDQ3059012
Mariusz Meszka, Alexander Rosa
Publication date: 8 December 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items (19)
On maximum packings of λ-fold complete 3-uniform hypergraphs with triple-hyperstars of size 4 ⋮ 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 ⋮ On Hamilton cycle decompositions of \(r\)-uniform \(r\)-partite hypergraphs ⋮ The perfect matching and tight Hamilton cycle decomposition of complete \(n\)-balanced \(mk\)-partite \(k\)-uniform hypergraphs ⋮ A possible analogue of \(\rho\)-labellings for 3-uniform hypergraphs ⋮ Decomposing complete 3-uniform hypergraph K_{n}^{(3)} into 7-cycles ⋮ Maximum packings of the λ-fold complete 3-uniform hypergraph with loose 3-cycles ⋮ Spectrum of 3-uniform 6- and 9-cycle systems over \(K_v^{( 3 )} - I\) ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Large Sets of Wrapped K–K Hamilton Cycle Decompositions of Complete Bipartite 3‐Uniform Hypergraphs ⋮ Hamiltonian decompositions of complete \(k\)-uniform hypergraphs ⋮ Edge orbits and cyclic and \(r\)-pyramidal decompositions of complete uniform hypergraphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs ⋮ Perfect Matching and Hamilton Tight Cycle Decomposition of Complete $n$-Balanced $r$-Partite $k$-Uniform Hypergraphs
This page was built for publication:
