Author:
Glock Stefan,Joos Felix,Kühn Daniela,Osthus Deryk
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference25 articles.
1. R. F. BAILEY and B. STEVENS: Hamiltonian decompositions of complete k-uniform hypergraphs, Discrete Math.310 (2010), 3088–3095.
2. D. BAL and A. FRIEZE: Packing tight Hamilton cycles in uniform hypergraphs, SIAM J. Discrete Math.26 (2012), 435–451.
3. Z. BARANYAI: The edge-coloring of complete hypergraphs. I, J. Combin. Theory Ser. B26 (1979), 276–294.
4. S. R. BLACKBURN: The existence of k-radius sequences, J. Combin. Theory Ser. A119 (2012), 212–217.
5. F. CHUNG, P. DLACONIS and R. GRAHAM: Universal cycles for combinatorial structures, Proceedings of the Twentieth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Florida, 1989), Congr. Numer. 70-74, Utilitas Math., 1990.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献