Decompositions of Km, n and Kn into cubes. - Darryn E. Bryant; Saad I. El-Zanati; Robert B. Gardner (Australas. J Comb., 1994)

Maximum packings with odd cycles. - Saad I. El-Zanati (Discret. Math., 1994)

Lambda-fold cube decompositions. - Peter Adams 001; Darryn E. Bryant; Saad I. El-Zanati (Australas. J Comb., 1995)

Factorization of regular multigraphs into regular graphs. - Saad I. El-Zanati; Michael Plantholt; Shailesh K. Tipnis (J. Graph Theory, 1995)

The intersection problem for cubes. - Peter Adams 001; Darryn E. Bryant; Abdollah Khodkar; Saad I. El-Zanati (Australas. J Comb., 1997)

d-Cube decompositions ofKn/Km. - Peter Adams 001; Darryn E. Bryant; Saad I. El-Zanati; Charles Vanden Eynden (Graphs Comb., 1997)

Extensions of some factorization results from simple graphs to multigraphs. - Saad I. El-Zanati; Michael Plantholt; Shailesh K. Tipnis (J. Graph Theory, 1997)

Graph Decompositions into Generalized Cubes. - Saad I. El-Zanati; Michael Plantholt; Charles Vanden Eynden (Ars Comb., 1998)

Cycle factorizations of cycle products. - Saad I. El-Zanati; Charles Vanden Eynden (Discret. Math., 1998)

Packing and covering the complete graph with cubes. - Peter Adams 001; Darryn E. Bryant; Saad I. El-Zanati (Australas. J Comb., 1999)

Factorizations of Km, n into Spanning Trees. - Saad I. El-Zanati; Charles Vanden Eynden (Graphs Comb., 1999)

On the decomposition of Cayley graphs into isomorphic trees. - Saad I. El-Zanati; Charles Vanden Eynden; Sidney Stubbs (Australas. J Comb., 2000)

Near α-labelings of bipartite graphs. - Saad I. El-Zanati; M. J. Kenig; Charles Vanden Eynden (Australas. J Comb., 2000)

On Graphs with Strong a-valuations. - Saad I. El-Zanati; Charles Vanden Eynden (Ars Comb., 2000)

On the alpha-labeling number of bipartite graphs. - Saad I. El-Zanati; Hung-Lin Fu; Chin-Lin Shiue (Discret. Math., 2000)

Maximal sets of Hamilton cycles in Kn, n. - Darryn E. Bryant; Saad I. El-Zanati; Christopher A. Rodger (J. Graph Theory, 2000)

Factorizations of complete multipartite graphs into generalized cubes. - Saad I. El-Zanati; Charles Vanden Eynden (J. Graph Theory, 2000)

On the cyclic decomposition of complete graphs into bipartite graphs. - Saad I. El-Zanati; Charles Vanden Eynden; Narong Punnim (Australas. J Comb., 2001)

On a-valuations of disconnected graphs. - Saad I. El-Zanati; Charles Vanden Eynden (Ars Comb., 2001)

Star Decompositions of Cubes. - Darryn E. Bryant; Saad I. El-Zanati; Charles Vanden Eynden; Dean G. Hoffman (Graphs Comb., 2001)

Star factorizations of graph products. - Darryn E. Bryant; Saad I. El-Zanati; Charles Vanden Eynden (J. Graph Theory, 2001)

Factorizations of and by powers of complete graphs. - Darryn E. Bryant; Saad I. El-Zanati; Charles Vanden Eynden (Discret. Math., 2002)

On the Hamilton-Waterloo Problem. - Peter Adams 001; Elizabeth J. Billington; Darryn E. Bryant; Saad I. El-Zanati (Graphs Comb., 2002)

A generalization of the Oberwolfach problem. - Saad I. El-Zanati; Shailesh K. Tipnis; Charles Vanden Eynden (J. Graph Theory, 2002)

Factorizations of the Complete Graph into C 5-Factors and 1-Factors. - Peter Adams 001; Darryn E. Bryant; Saad I. El-Zanati; Heather Gavlas (Graphs Comb., 2003)

Labelings of unions of up to four uniform cycles. - Diane M. Donovan; Saad I. El-Zanati; Charles Vanden Eynden; Somporn Sutinuntopas (Australas. J Comb., 2004)

On the cyclic decomposition of complete graphs into almost-bipartite graphs. - Andrew Blinco; Saad I. El-Zanati; Charles Vanden Eynden (Discret. Math., 2004)

On a generalization of the Oberwolfach problem. - Nicholas J. Cavenagh; Saad I. El-Zanati; Abdollah Khodkar; Charles Vanden Eynden (J. Comb. Theory A, 2004)

Decomposing complete graphs into cubes. - Saad I. El-Zanati; Charles Vanden Eynden (Discuss. Math. Graph Theory, 2006)

On ρ-labeling the union of three cycles. - Alejandro Aguado; Saad I. El-Zanati; Heidi Hake; Jessica Stob; Hera Yayla (Australas. J Comb., 2007)

Erratum to: "Star factorizations of graph products". - Darryn E. Bryant; Saad I. El-Zanati; Charles Vanden Eynden (J. Graph Theory, 2007)

On vector space partitions and uniformly resolvable designs. - Andrew Blinco; Saad I. El-Zanati; G. F. Seelinger; Papa Amar Sissokho; L. E. Spence; Charles Vanden Eynden (Des. Codes Cryptogr., 2008)

On Cyclic (C2m+e)-designs. - G. W. Blair; D. L. Bowman; Saad I. El-Zanati; S. M. Hlad; M. K. Priban; K. A. Sebesta (Ars Comb., 2009)

On partitions of finite vector spaces of low dimension over GF(2). - Saad I. El-Zanati; G. F. Seelinger; Papa Amar Sissokho; L. E. Spence; Charles Vanden Eynden (Discret. Math., 2009)

The maximum size of a partial 3-spread in a finite vector space over GF(2). - Saad I. El-Zanati; Heather Jordon; G. F. Seelinger; Papa A. Sissokho; L. E. Spence (Des. Codes Cryptogr., 2010)

Gregarious GDDs with Two Associate Classes. - Saad I. El-Zanati; Narong Punnim; Christopher A. Rodger (Graphs Comb., 2010)

On the cyclic decomposition of circulant graphs into almost-bipartite graphs. - Saad I. El-Zanati; Kyle King; Jeff Mudrock (Australas. J Comb., 2011)

On lambda-fold partitions of finite vector spaces and duality. - Saad I. El-Zanati; G. F. Seelinger; Papa A. Sissokho; L. E. Spence; Charles Vanden Eynden (Discret. Math., 2011)

All 2-regular graphs with uniform odd components admit ρ-labellings. - Dan Gannon; Saad I. El-Zanati (Australas. J Comb., 2012)

On γ-labeling the almost-bipartite graph Pm+e. - Ryan C. Bunge; Saad I. El-Zanati; W. O'Hanlon; Charles Vanden Eynden (Ars Comb., 2012)

On cyclic G-designs where G is a cubic tripartite graph. - Wannasiri Wannasit; Saad I. El-Zanati (Discret. Math., 2012)

On the cyclic decomposition of circulant graphs into bipartite graphs. - Ryan C. Bunge; Saad I. El-Zanati; Chepina Rumsey; Charles Vanden Eynden (Australas. J Comb., 2013)

On Cyclic Decompositions of Complete Graphs into Tripartite Graphs. - Ryan C. Bunge; Avapa Chantasartrassmee; Saad I. El-Zanati; Charles Vanden Eynden (J. Graph Theory, 2013)

On Decomposing the Complete Graph into the Union of Two Disjoint Cycles. - Saad I. El-Zanati; Uthoomporn Jongthawonwuth; Heather Jordon; Charles Vanden Eynden (IWOCA, 2014)

On extending the Bose construction for triple systems to decompositions of complete multipartite graphs into 2-regular graphs of odd order. - Uthoomporn Jongthawonwuth; Saad I. El-Zanati; Chariya Uiyyasathian (Australas. J Comb., 2014)

On decomposing even regular multigraphs into small isomorphic trees. - Saad I. El-Zanati; Michael Plantholt; Shailesh K. Tipnis (Discret. Math., 2014)

On decomposing regular graphs into isomorphic double-stars. - Saad I. El-Zanati; Marie Ermete; James Hasty; Michael Plantholt; Shailesh K. Tipnis (Discuss. Math. Graph Theory, 2015)

On λ-fold Rosa-type Labelings of Bipartite Multigraphs. - Ryan C. Bunge; Saad I. El-Zanati; Jeff Mudrock; Charles Vanden Eynden; Wannasiri Wannasit (Electron. Notes Discret. Math., 2017)

The Spectrum Problem for the Cubic Graphs of Order 8. - Peter Adams 001; Saad I. El-Zanati; Wannasiri Wannasit (Ars Comb., 2018)

Edge orbits and cyclic and r-pyramidal decompositions of complete uniform hypergraphs. - Ryan C. Bunge; Saad I. El-Zanati; Joel Jeffries; Charles Vanden Eynden (Discret. Math., 2018)

Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph G where G is the union of two disjoint cycles. - Saad I. El-Zanati; Uthoomporn Jongthawonwuth; Heather Jordon; Charles Vanden Eynden (Eur. J. Comb., 2018)

On loose 4-cycle decompositions of complete 3-uniform hypergraphs. - Ryan C. Bunge; Saad I. El-Zanati; Lauren Haman; Cody Hatzer; Kristin Koe; Kayla Spornberger (Bull. ICA, 2019)

On decomposing the complete symmetric digraph into orientations of K4-e. - Ryan C. Bunge; Brian D. Darrow; Toni M. Dubczuk; Saad I. El-Zanati; Hanson H. Hao; Gregory L. Keller; Genevieve A. Newkirk; Dan P. Roberts (Discuss. Math. Graph Theory, 2019)

On 2- and 3-factorizations of complete 3-uniform hypergraphs of order up to 9. - Peter Adams 001; Saad I. El-Zanati; Peter Florido; William F. Turner (Australas. J Comb., 2020)

Decompositions of complete graphs and complete bipartite graphs into bipartite cubic graphs of order at most 12. - Peter Adams 001; Ryan C. Bunge; Roger B. Eggleton; Saad I. El-Zanati; Ugur Odabasi; Wannasiri Wannasit (Bull. ICA, 2021)

The spectrum problem for the connected cubic graphs of order 10. - Peter Adams 001; Saad I. El-Zanati; Ugur Odabasi; Wannasiri Wannasit (Discuss. Math. Graph Theory, 2021)

On maximum packings of λ-fold complete 3-uniform hypergraphs with triple-hyperstars of size 4. - Amber Armstrong; Ryan C. Bunge; William Duncan; Saad I. El-Zanati; Kristin Koe; Rachel Stutzman (Electron. J. Graph Theory Appl., 2021)

On tight 6-cycle decompositions of complete 3-uniform hypergraphs. - Matthew Akin; Ryan C. Bunge; Saad I. El-Zanati; Joshua Hamilton; Brittany Kolle; Sabrina Lehmann; Levi Neiburger (Discret. Math., 2022)

On loose 3-cycle decompositions of complete 4-uniform hypergraphs. - Ryan C. Bunge; Saad I. El-Zanati; Peter Florido; Cole Gaskins; William F. Turner; Patrick Ward (Australas. J Comb., 2023)