Refereed Articles
16- Allagan, J. A., Serkan C., Bell numbers of complete multipartite graphs (Submitted).
15- Allagan, J. A., Bobga, B. and Johnson. P., On the choosability of some graphs ( To appear).
14- Allagan, J. A., Voloshin, V, Coloring k-trees with forbidden monochrome or rainbow triangles (Submitted).
13- Allagan, J. A., Mphako-Banda, E., Formulas for the computation of the Tutte polynomial of graphs with parallel classes ( Submitted).
12- Allagan, J. A., Mphako-Banda, E., Tutte Polynomials of Some Multigraphs, Quaetiones Mathematicae (2015) 1-16
11-Allagan, J. A., Johnson, P., Estimates of the Choice Numbers and the Ohba numbers of some complete multipartite graphs,Ars Combinatoria vol CXIX (2015)pp 167-176
10-Allagan, J. A., Slutzky, D., Chromatic Polynomials of Mixed Hypercycles, Discussiones Mathematicae Graph Theory 34(3), 547-558, (2014)
9-Allagan, J. A., Slutzky, D., Chromatic Polynomials of Mixed Hypergraphs, Australasian Journal of Combinatorics 58(1) (2004),197-213 (2014)
8-Allagan, J. A., Chromatic Polynomials of Some (m,l)- Hyperwheels, Computer Science Journal of Moldova vol.22, no.1(64)(2014) .
7-Allagan, J. A., Chromatic Polynomials of Some Sunflower Mixed Hypergraphs, Contributions to Discrete mathematics Vol 9, No 2(2014), 35-44
6-Allagan, J. A., Tutte Polynomials of multi-bridge graphs, Computer Science Journal of Moldova, vol.21, no.2(62)(2013)
5-Allagan, J. A., Hendon, M., Johnson, P., and Slutzky, D., On the Existence of S-graphs: Symmetric and Diametrical Bipartite Graphs, Journal of Combinatorial Mathematics and Combinatorial Computing vol.83 (2012).
4-Allagan, J. A., Hall numbers of some complete k-partite graphs, Utilitas Mathematica vol.89 ( 2012), 257-267.
3-Allagan, J.A., Johnson, P., The Choice Number of K(4, 2, . . . , 2)− A Dispute Resolved, Congressus Numerantium, vol 191(2008) 65–70.
2-Allagan, J.A., The chromatic polynomials of some linear uniform hypergraphs, Congressus Numerantium, vol. CLXXXVII, (2007).
1-Allagan, J.A., A generalization of the chromatic polynomial of a cycle, Computer Science Journal of Moldova, vol.13, no.1(2005).
