Saad I. El-Zanati

Orcid: 0000-0002-7680-5433

Affiliations:
  • Illinois State University, Department of Mathematics, Normal, IL, USA


According to our database1, Saad I. El-Zanati authored at least 59 papers between 1994 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On loose 3-cycle decompositions of complete 4-uniform hypergraphs.
Australas. J Comb., 2023

2022
On tight 6-cycle decompositions of complete 3-uniform hypergraphs.
Discret. Math., 2022

2021
On maximum packings of λ-fold complete 3-uniform hypergraphs with triple-hyperstars of size 4.
Electron. J. Graph Theory Appl., 2021

The spectrum problem for the connected cubic graphs of order 10.
Discuss. Math. Graph Theory, 2021

Decompositions of complete graphs and complete bipartite graphs into bipartite cubic graphs of order at most 12.
Bull. ICA, 2021

2020
On 2- and 3-factorizations of complete 3-uniform hypergraphs of order up to 9.
Australas. J Comb., 2020

2019
On decomposing the complete symmetric digraph into orientations of <i>K<sub>4</sub>-e</i>.
Discuss. Math. Graph Theory, 2019

On loose 4-cycle decompositions of complete 3-uniform hypergraphs.
Bull. ICA, 2019

2018
Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph <i>G</i> where <i>G</i> is the union of two disjoint cycles.
Eur. J. Comb., 2018

Edge orbits and cyclic and r-pyramidal decompositions of complete uniform hypergraphs.
Discret. Math., 2018

The Spectrum Problem for the Cubic Graphs of Order 8.
Ars Comb., 2018

2017
On λ-fold Rosa-type Labelings of Bipartite Multigraphs.
Electron. Notes Discret. Math., 2017

2015
On decomposing regular graphs into isomorphic double-stars.
Discuss. Math. Graph Theory, 2015

2014
On decomposing even regular multigraphs into small isomorphic trees.
Discret. Math., 2014

On extending the Bose construction for triple systems to decompositions of complete multipartite graphs into 2-regular graphs of odd order.
Australas. J Comb., 2014

On Decomposing the Complete Graph into the Union of Two Disjoint Cycles.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2013
On Cyclic Decompositions of Complete Graphs into Tripartite Graphs.
J. Graph Theory, 2013

On the cyclic decomposition of circulant graphs into bipartite graphs.
Australas. J Comb., 2013

2012
On cyclic G-designs where G is a cubic tripartite graph.
Discret. Math., 2012

On γ-labeling the almost-bipartite graph P<sub>m</sub>+e.
Ars Comb., 2012

All 2-regular graphs with uniform odd components admit ρ-labellings.
Australas. J Comb., 2012

2011
On lambda-fold partitions of finite vector spaces and duality.
Discret. Math., 2011

On the cyclic decomposition of circulant graphs into almost-bipartite graphs.
Australas. J Comb., 2011

2010
Gregarious GDDs with Two Associate Classes.
Graphs Comb., 2010

The maximum size of a partial 3-spread in a finite vector space over <i>GF</i>(2).
Des. Codes Cryptogr., 2010

2009
On partitions of finite vector spaces of low dimension over GF(2).
Discret. Math., 2009

On Cyclic (C<sub>2m</sub>+e)-designs.
Ars Comb., 2009

2008
On vector space partitions and uniformly resolvable designs.
Des. Codes Cryptogr., 2008

2007
Erratum to: "Star factorizations of graph products".
J. Graph Theory, 2007

On ρ-labeling the union of three cycles.
Australas. J Comb., 2007

2006
Decomposing complete graphs into cubes.
Discuss. Math. Graph Theory, 2006

2004
On a generalization of the Oberwolfach problem.
J. Comb. Theory, Ser. A, 2004

On the cyclic decomposition of complete graphs into almost-bipartite graphs.
Discret. Math., 2004

Labelings of unions of up to four uniform cycles.
Australas. J Comb., 2004

2003
Factorizations of the Complete Graph into <i>C</i> <sub>5</sub>-Factors and 1-Factors.
Graphs Comb., 2003

2002
A generalization of the Oberwolfach problem.
J. Graph Theory, 2002

On the Hamilton-Waterloo Problem.
Graphs Comb., 2002

Factorizations of and by powers of complete graphs.
Discret. Math., 2002

2001
Star factorizations of graph products.
J. Graph Theory, 2001

Star Decompositions of Cubes.
Graphs Comb., 2001

On a-valuations of disconnected graphs.
Ars Comb., 2001

On the cyclic decomposition of complete graphs into bipartite graphs.
Australas. J Comb., 2001

2000
Factorizations of complete multipartite graphs into generalized cubes.
J. Graph Theory, 2000

Maximal sets of Hamilton cycles in <i>K<sub>n, n</sub></i>.
J. Graph Theory, 2000

On the alpha-labeling number of bipartite graphs.
Discret. Math., 2000

On Graphs with Strong a-valuations.
Ars Comb., 2000

Near α-labelings of bipartite graphs.
Australas. J Comb., 2000

On the decomposition of Cayley graphs into isomorphic trees.
Australas. J Comb., 2000

1999
Factorizations of Km, n into Spanning Trees.
Graphs Comb., 1999

Packing and covering the complete graph with cubes.
Australas. J Comb., 1999

1998
Cycle factorizations of cycle products.
Discret. Math., 1998

Graph Decompositions into Generalized Cubes.
Ars Comb., 1998

1997
Extensions of some factorization results from simple graphs to multigraphs.
J. Graph Theory, 1997

<i>d</i>-Cube decompositions of<i>K</i><sub>n</sub>/<i>K</i><sub>m</sub>.
Graphs Comb., 1997

The intersection problem for cubes.
Australas. J Comb., 1997

1995
Factorization of regular multigraphs into regular graphs.
J. Graph Theory, 1995

Lambda-fold cube decompositions.
Australas. J Comb., 1995

1994
Maximum packings with odd cycles.
Discret. Math., 1994

Decompositions of K<sub>m, n</sub> and K<sub>n</sub> into cubes.
Australas. J Comb., 1994


  Loading...