Dyer, Danny; Haghshenas, Sadegheh; Shalaby, Nabil The spectrum of optimal excess graphs for trees with up to four edges. (English) Zbl 1439.05135 AKCE Int. J. Graphs Comb. 16, No. 3, 272-279 (2019). MSC: 05C50 PDF BibTeX XML Cite \textit{D. Dyer} et al., AKCE Int. J. Graphs Comb. 16, No. 3, 272--279 (2019; Zbl 1439.05135) Full Text: DOI
Dyer, Danny; Haghshenas, Sadegheh; Shalaby, Nabil Constructing the spectrum for packings of the complete graph with trees that have up to five edges. (English) Zbl 1355.05196 J. Comb. Math. Comb. Comput. 98, 65-88 (2016). Reviewer: Dragan Stevanović (Niš) MSC: 05C70 05C05 PDF BibTeX XML Cite \textit{D. Dyer} et al., J. Comb. Math. Comb. Comput. 98, 65--88 (2016; Zbl 1355.05196)
Dyer, Danny; Haghshenas, Sadegheh; Shalaby, Nabil Constructing the spectrum of packings and coverings for the complete graph with 4-stars. (English) Zbl 1341.05153 J. Comb. Math. Comb. Comput. 96, 321-334 (2016). MSC: 05C51 05C70 PDF BibTeX XML Cite \textit{D. Dyer} et al., J. Comb. Math. Comb. Comput. 96, 321--334 (2016; Zbl 1341.05153)
Dyer, Danny; Haghshenas, Sadegheh; Shalaby, Nabil Constructing the spectrum of packings and coverings for the complete graph with stars with up to five edges. (English) Zbl 1339.05305 Graphs Comb. 32, No. 3, 943-961 (2016). MSC: 05C70 PDF BibTeX XML Cite \textit{D. Dyer} et al., Graphs Comb. 32, No. 3, 943--961 (2016; Zbl 1339.05305) Full Text: DOI