Hamiltonian decomposition of complete bipartite \(r\)-hypergraphs
From MaRDI portal
Publication:5957991
DOI10.1007/BF02669710zbMath0993.05114MaRDI QIDQ5957991
Publication date: 2 June 2002
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Hypergraphs (05C65) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items (5)
Defective colorings on k-uniform hypergraphs ⋮ Decomposing complete 3-uniform hypergraph K_{n}^{(3)} into 7-cycles ⋮ Large Sets of Wrapped K–K Hamilton Cycle Decompositions of Complete Bipartite 3‐Uniform Hypergraphs ⋮ Star graph automorphisms and disjoint Hamilton cycles ⋮ Sufficient conditions for hypergraphs to be maximally edge-connected
Cites Work
This page was built for publication: Hamiltonian decomposition of complete bipartite \(r\)-hypergraphs