Ebadollah S. Mahmoodian - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 36 from 36

2019

The Chromatic Number of Finite Group Cayley TablesLuis A. Goddyn, Kevin Halasz, Ebadollah S. Mahmoodian. combinatorics, 26(1):1, 2019. [doi]

2016

On the chromatic number of Latin square graphsNazli Besharati, Luis A. Goddyn, Ebadollah S. Mahmoodian, M. Mortezaeefar. DM, 339(11):2613-2619, 2016. [doi]

The square chromatic number of the torusA. G. Chegini, Morteza Hasanvand, Ebadollah S. Mahmoodian, Farokhlagha Moazami. DM, 339(2):447-456, 2016. [doi]

2015

Sudoku Rectangle Completion (Extended Abstract)Mohammad Mahdian, Ebadollah S. Mahmoodian. endm, 49:747-755, 2015. [doi]

2013

Silver Block Intersection Graphs of Steiner 2-DesignsA. Ahadi, Nazli Besharati, Ebadollah S. Mahmoodian, M. Mortezaeefar. gc, 29(4):735-746, 2013. [doi]

Possible volumes of t-(v, t+1) Latin tradesEbadollah S. Mahmoodian, M. S. Najafian. arscom, 109:485-496, 2013.

2012

On the existence of 3-way k-homogeneous Latin tradesBehrooz Bagheri Gh., Diane Donovan, Ebadollah S. Mahmoodian. DM, 312(24):3473-3481, 2012. [doi]

A linear algebraic approach to orthogonal arrays and Latin squaresA. A. Khanban, Mohammad Mahdian, Ebadollah S. Mahmoodian. arscom, 105:3-13, 2012.

2009

Vertex domination of generalized Petersen graphsB. Javad Ebrahimi, Nafiseh Jahanbakht, Ebadollah S. Mahmoodian. DM, 309(13):4355-4361, 2009. [doi]

2008

On minimum vertex covers of generalized Petersen graphsBabak Behsaz, Pooya Hatami, Ebadollah S. Mahmoodian. ajc, 40:253-264, 2008. [doi]

Silver CubesMohammad Ghebleh, Luis A. Goddyn, Ebadollah S. Mahmoodian, Maryam Verdian-Rizi. gc, 24(5):429-442, 2008. [doi]

2006

On the defining sets of some special graphsEbadollah S. Mahmoodian, Behnaz Omoomi, Yee-Hock Peng. ajc, 35:69-82, 2006. [doi]

Smallest defining number of r-regular k-chromatic graphs: r :::1::: kEbadollah S. Mahmoodian, Behnaz Omoomi, Nasrin Soltankhah. arscom, 78, 2006.

2005

On the size of the minimum critical set of a Latin squareMahya Ghandehari, Hamed Hatami, Ebadollah S. Mahmoodian. DM, 293(1-3):121-127, 2005. [doi]

On defining numbers of k-chromatic k-regular graphsNasrin Soltankhah, Ebadollah S. Mahmoodian. arscom, 76, 2005.

2004

On the forced matching numbers of bipartite graphsPeter Adams, Mohammad Mahdian, Ebadollah S. Mahmoodian. DM, 281(1-3):1-12, 2004. [doi]

On the spectrum of the forced matching number of graphsPeyman Afshani, Hamed Hatami, Ebadollah S. Mahmoodian. ajc, 30:147-160, 2004. [doi]

2003

A new bound on the size of the largest critical set in a Latin squareRichard Bean, Ebadollah S. Mahmoodian. DM, 267(1-3):13-21, 2003. [doi]

2002

The three-way intersection problem for latin squaresPeter Adams, Elizabeth J. Billington, Darryn E. Bryant, Ebadollah S. Mahmoodian. DM, 243(1-3):1-19, 2002. [doi]

2001

On Uniquely List Colorable GraphsMohammad Ghebleh, Ebadollah S. Mahmoodian. arscom, 59, 2001.

A linear algebraic approach to directed designsEbadollah S. Mahmoodian, Nasrin Soltankhah. ajc, 23:119-134, 2001. [doi]

2000

On the simultaneous edge-coloring conjectureMohammad Taghi Hajiaghayi, Ebadollah S. Mahmoodian, Seyed Vahab Mirrokni, Amin Saberi, Ruzbeh Tusserkani. DM, 216(1-3):267-272, 2000. [doi]

On a conjecture of Keedwell and the cycle double cover conjectureMohammad Mahdian, Ebadollah S. Mahmoodian, Amin Saberi, Mohammad R. Salavatipour, Ruzbeh Tusserkani. DM, 216(1-3):287-292, 2000. [doi]

1999

A Characterization of Uniquely 2-List Colorable GraphsMohammad Mahdian, Ebadollah S. Mahmoodian. arscom, 51, 1999.

On defining numbers of vertex colouring of regular graphsEbadollah S. Mahmoodian, Eric Mendelsohn. DM, 197-198:543-554, 1999. [doi]

On defining sets of directed designsEbadollah S. Mahmoodian, Nasrin Soltankhah, Anne Penfold Street. ajc, 19:179-190, 1999. [doi]

1997

Uniquely Total Colorable GraphsS. Akbari, Mehdi Behzad, Hossein Hajiabolhassan, Ebadollah S. Mahmoodian. gc, 13(4):305-314, 1997. [doi]

Critical sets in back circulant Latin rectanglesEbadollah S. Mahmoodian, G. H. John van Rees. ajc, 16:45-50, 1997. [doi]

Defining sets in vertex colorings of graphs and latin rectanglesEbadollah S. Mahmoodian, Reza Naserasr, Manouchehr Zaker. DM, 167-168:451-460, 1997. [doi]

1994

Eccentric sequences and triangle sequences of block designsMehdi Behzad, Ebadollah S. Mahmoodian. DM, 127(1-3):47-56, 1994. [doi]

1993

Multi-Set designs and numbers of common triplesElizabeth J. Billington, Ebadollah S. Mahmoodian. gc, 9(2-4):105-115, 1993. [doi]

Support sizes of sixfold triple systemsCharles J. Colbourn, Ebadollah S. Mahmoodian. DM, 115(1-3):103-131, 1993. [doi]

Orthogonal arrays and ordered threshold schemesEd Dawson, Ebadollah S. Mahmoodian, Alan Rahilly. ajc, 8:27-44, 1993. [doi]

1992

Some new families of simple t-designsEbadollah S. Mahmoodian, M. Shirdarreh. ajc, 5:159-168, 1992. [doi]

On the existence of (v, k, t) tradesEbadollah S. Mahmoodian, Nasrin Soltankhah. ajc, 6:279-292, 1992. [doi]

1990

The spectrum of support sizes for threefold triple systemsCharles J. Colbourn, Ebadollah S. Mahmoodian. DM, 83(1):9-19, 1990. [doi]

Sign in or sign up to see more results.

runs on WebDSL