Atif A. Abueida

According to our database1, Atif A. Abueida authored at least 15 papers between 2003 and 2014.

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

Timeline

2004
2006
2008
2010
2012
2014
0
1
2
3
4
1
3
1
1
2
1
2
2
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2014
On the decompositions of complete graphs into cycles and stars on the same number of edges.
Discuss. Math. Graph Theory, 2014

2013
Hamiltonian Spider Intersection Graphs Are Cycle Extendable.
SIAM J. Discret. Math., 2013

Multidecompositions of Several Graph Products.
Graphs Comb., 2013

Reducible and purely heterogeneous decompositions of uniform complete multigraphs into spanning trees.
Australas. J Comb., 2013

2012
Completing a solution of the embedding problem for incomplete idempotent latin squares when numerical conditions suffice.
Discret. Math., 2012

2011
Equitable edge coloured Steiner triple systems.
Australas. J Comb., 2011

2010
A Min-Max Property of Chordal Bipartite Graphs with Applications.
Graphs Comb., 2010

Multidecomposition of K<sub>n</sub> - F into Graph-Pairs of Order 5 where F is a Hamilton Cycle or an (almost) 1-Factor.
Ars Comb., 2010

2009
Multidecomposition of the complete graph into graph pairs of order 4 with various leaves.
Ars Comb., 2009

2006
Cycle Extendability and Hamiltonian Cycles in Chordal Graph Classes.
SIAM J. Discret. Math., 2006

A note on the recognition of bisplit graphs.
Discret. Math., 2006

2005
Multidesigns of the λ-fold complete graph for graph-pairs of orders 4 and 5.
Australas. J Comb., 2005

Determining properties of a multipartite tournament from its lattice of convex subsets.
Australas. J Comb., 2005

2004
Multidecompositions of the complete graph.
Ars Comb., 2004

2003
Multidesigns for Graph-Pairs of Order 4 and 5.
Graphs Comb., 2003


  Loading...