Bahmanian, Amin; Haghshenas, Sadegheh Extending regular edge-colorings of complete hypergraphs. (English) Zbl 07202775 J. Graph Theory 94, No. 1, 59-74 (2020). MSC: 05C PDF BibTeX XML Cite \textit{A. Bahmanian} and \textit{S. Haghshenas}, J. Graph Theory 94, No. 1, 59--74 (2020; Zbl 07202775) Full Text: DOI
Bahmanian, Amin Extending edge-colorings of complete hypergraphs into regular colorings. (English) Zbl 07047770 J. Graph Theory 90, No. 4, 547-560 (2019). MSC: 05C PDF BibTeX XML Cite \textit{A. Bahmanian}, J. Graph Theory 90, No. 4, 547--560 (2019; Zbl 07047770) Full Text: DOI
Bahmanian, Amin; Haghshenas, Sadegheh Partitioning the edge set of a hypergraph into almost regular cycles. (English) Zbl 1402.05173 J. Comb. Des. 26, No. 10, 465-479 (2018). MSC: 05C70 05C65 05C38 05C45 PDF BibTeX XML Cite \textit{A. Bahmanian} and \textit{S. Haghshenas}, J. Comb. Des. 26, No. 10, 465--479 (2018; Zbl 1402.05173) Full Text: DOI
Bahmanian, M. A. Factorizations of complete multipartite hypergraphs. (English) Zbl 1351.05160 Discrete Math. 340, No. 2, 46-50 (2017). MSC: 05C65 05C70 PDF BibTeX XML Cite \textit{M. A. Bahmanian}, Discrete Math. 340, No. 2, 46--50 (2017; Zbl 1351.05160) Full Text: DOI
Colbourn, Charles J.; Fan, Bingli; Horsley, Daniel Disjoint spread systems and fault location. (English) Zbl 1348.05045 SIAM J. Discrete Math. 30, No. 4, 2011-2026 (2016). MSC: 05B30 05A18 05D99 62K05 68P10 PDF BibTeX XML Cite \textit{C. J. Colbourn} et al., SIAM J. Discrete Math. 30, No. 4, 2011--2026 (2016; Zbl 1348.05045) Full Text: DOI
Katona, Gyula O. H. Constructions via Hamiltonian theorems. (English) Zbl 1077.05096 Discrete Math. 303, No. 1-3, 87-103 (2005). MSC: 05D05 05C45 PDF BibTeX XML Cite \textit{G. O. H. Katona}, Discrete Math. 303, No. 1--3, 87--103 (2005; Zbl 1077.05096) Full Text: DOI
Kündgen, André; Mubayi, Dhruv; Tetali, Prasad Minimal completely separating systems of \(k\)-sets. (English) Zbl 0979.05102 J. Comb. Theory, Ser. A 93, No. 1, 192-198 (2001). Reviewer: Ko-Wei Lih (Nankang) MSC: 05D05 PDF BibTeX XML Cite \textit{A. Kündgen} et al., J. Comb. Theory, Ser. A 93, No. 1, 192--198 (2001; Zbl 0979.05102) Full Text: DOI
Häggkvist, R.; Hellgren, T. Extensions of edge-colourings in hypergraphs. I. (English) Zbl 0795.05053 Miklós, D. (ed.) et al., Combinatorics, Paul Erdős is eighty. Vol. 1. Budapest: János Bolyai Mathematical Society. Bolyai Society Mathematical Studies. 215-238 (1993). Reviewer: V.D.Tonchev (Houghton) MSC: 05C15 05C65 05C70 PDF BibTeX XML Cite \textit{R. Häggkvist} and \textit{T. Hellgren}, in: Combinatorics, Paul Erdős is eighty. Vol. 1. Budapest: János Bolyai Mathematical Society. 215--238 (1993; Zbl 0795.05053)
Brouwer, A. E.; Tijdeman, R. On the edge-colouring problem for unions of complete uniform hypergraphs. (English) Zbl 0471.05049 Discrete Math. 34, 241-260 (1981). MSC: 05C65 05C70 PDF BibTeX XML Cite \textit{A. E. Brouwer} and \textit{R. Tijdeman}, Discrete Math. 34, 241--260 (1981; Zbl 0471.05049) Full Text: DOI