| 2012 | ||
|---|---|---|
| j20 | A. A. Khanban, Mohammad Mahdian, Ebadollah S. Mahmoodian: A linear algebraic approach to orthogonal arrays and Latin squares. Ars Comb. 105: 3-13 (2012) | |
| j19 | Behrooz Bagheri Gh., Diane Donovan, Ebadollah S. Mahmoodian: On the existence of 3-way k-homogeneous Latin trades. Discrete Mathematics 312(24): 3473-3481 (2012) | |
| 2011 | ||
| i2 | Golnaz Ghasemiesfeh, Shabnam Shariaty, Nazli Besharati, Ebadollah S. Mahmoodian: Algorithms for Silver Coloring of Generalized Petersen Graphs. CoRR abs/1102.1123 (2011) | |
| 2010 | ||
| i1 | Babak Behsaz, Pooya Hatami, Ebadollah S. Mahmoodian: On minimum vertex cover of generalized Petersen graphs. CoRR abs/1008.3208 (2010) | |
| 2009 | ||
| j18 | B. Javad Ebrahimi, Nafiseh Jahanbakht, Ebadollah S. Mahmoodian: Vertex domination of generalized Petersen graphs. Discrete Mathematics 309(13): 4355-4361 (2009) | |
| 2008 | ||
| j17 | Mohammad Ghebleh, Luis A. Goddyn, Ebadollah S. Mahmoodian, Maryam Verdian-Rizi: Silver Cubes. Graphs and Combinatorics 24(5): 429-442 (2008) | |
| 2006 | ||
| j16 | Ebadollah S. Mahmoodian, Behnaz Omoomi, Nasrin Soltankhah: Smallest defining number of r-regular k-chromatic graphs: r 1 k. Ars Comb. 78 (2006) | |
| 2005 | ||
| j15 | Nasrin Soltankhah, Ebadollah S. Mahmoodian: On defining numbers of k-chromatic k-regular graphs. Ars Comb. 76 (2005) | |
| j14 | Mahya Ghandehari, Hamed Hatami, Ebadollah S. Mahmoodian: On the size of the minimum critical set of a Latin square. Discrete Mathematics 293(1-3): 121-127 (2005) | |
| 2004 | ||
| j13 | Peter Adams, Mohammad Mahdian, Ebadollah S. Mahmoodian: On the forced matching numbers of bipartite graphs. Discrete Mathematics 281(1-3): 1-12 (2004) | |
| 2003 | ||
| j12 | Richard Bean, Ebadollah S. Mahmoodian: A new bound on the size of the largest critical set in a Latin square. Discrete Mathematics 267(1-3): 13-21 (2003) | |
| 2002 | ||
| j11 | Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Ebadollah S. Mahmoodian: The three-way intersection problem for latin squares. Discrete Mathematics 243(1-3): 1-19 (2002) | |
| 2001 | ||
| j10 | ||
| 2000 | ||
| j9 | Mohammad Taghi Hajiaghayi, Ebadollah S. Mahmoodian, Seyed Vahab Mirrokni, Amin Saberi, Ruzbeh Tusserkani: On the simultaneous edge-coloring conjecture. Discrete Mathematics 216(1-3): 267-272 (2000) | |
| j8 | Mohammad Mahdian, Ebadollah S. Mahmoodian, Amin Saberi, Mohammad R. Salavatipour, Ruzbeh Tusserkani: On a conjecture of Keedwell and the cycle double cover conjecture. Discrete Mathematics 216(1-3): 287-292 (2000) | |
| 1999 | ||
| j7 | Mohammad Mahdian, Ebadollah S. Mahmoodian: A Characterization of Uniquely 2-List Colorable Graphs. Ars Comb. 51 (1999) | |
| j6 | Ebadollah S. Mahmoodian, Eric Mendelsohn: On defining numbers of vertex colouring of regular graphs. Discrete Mathematics 197-198: 543-554 (1999) | |
| 1997 | ||
| j5 | Ebadollah S. Mahmoodian, Reza Naserasr, Manouchehr Zaker: Defining sets in vertex colorings of graphs and latin rectangles. Discrete Mathematics 167-168: 451-460 (1997) | |
| 1994 | ||
| j4 | Mehdi Behzad, Ebadollah S. Mahmoodian: Eccentric sequences and triangle sequences of block designs. Discrete Mathematics 127(1-3): 47-56 (1994) | |
| 1993 | ||
| j3 | Charles J. Colbourn, Ebadollah S. Mahmoodian: Support sizes of sixfold triple systems. Discrete Mathematics 115(1-3): 103-131 (1993) | |
| j2 | Elizabeth J. Billington, Ebadollah S. Mahmoodian: Multi-Set designs and numbers of common triples. Graphs and Combinatorics 9(2-4): 105-115 (1993) | |
| 1990 | ||
| j1 | Charles J. Colbourn, Ebadollah S. Mahmoodian: The spectrum of support sizes for threefold triple systems. Discrete Mathematics 83(1): 9-19 (1990) | |
Colors in the list of coauthors
Last update Sun May 19 13:58:40 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page