1.	E. S. Mahmoodian (Joint with A. A. Khanban and M. Mahdian) A linear algebraic approach to orthogonal arrays and latin squares Ars Combin. (Accepted) [abstract]

2.	P. Afshani, H. Hatami and E. S. Mahmoodian On the spectrum of the forced matching number of graphs Australas. J. Combin. 30 (2004), 147-160  [abstract]

3.	H. Hatami and E. S. Mahmoodian A lower bound for the size of the largest critical sets in Latin squares Bull. Inst. Combin. Appl. 38 (2003), 19-22  [abstract]

4.	D. Donovan and E. S. Mahmoodian An algorithm for writing any Latin interchange as a sum of intercalates Bull. Inst. Combin. Appl. 34 (2002), 90-98  [abstract]    MR 2002j:05028

5.	E. S. Mahmoodian and N. Soltankhah A linear algebraic approach to directed designs Australas. J. Combin. 23 (2001), 119-134  [abstract]    MR 2001k:05034

6.	M. Ghebleh and E. S. Mahmoodian On uniquely list colorable graphs Ars Combin. 59 (2001), 307-318  [abstract]    MR 2002a:05099

7.	E. S. Mahmoodian, N. Soltankhah and A. Penfold Street On defining sets of directed designs Australas. J. Combin. 19 (1999), 179-190  [abstract]

8.	E. S. Mahmoodian and E. Mendelsohn On defining numbers of vertex colouring of regular graphs Discrete Math. 197/198 (1999), 543-554  [abstract]    MR 2000b:05023

9.	E. S. Mahmoodian Defining sets and uniqueness in graph colorings: A survey J. Statist. Plann. Inference 73 (1998), 85-89  [abstract]    MR 99i:05084

10.	S. Akbari, M. Behzad, H. Hajiabolhassan and E. S. Mahmoodian Uniquely total colorable graphs Graphs Combin. 13 (1997), 305-314  [abstract]    MR 99b:05052

11.	E. S. Mahmoodian and G.H.J. Van Rees Critical sets in back circulant latin rectangles Australas. J. Combin. 16 (1997), 45-50  [abstract]    MR 98e:05019