default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEbadollah S. Mahmoodian
Person information
- affiliation: Sharif University of Technology, Tehran, Iran
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j39]Luis A. Goddyn, Kevin Halasz
, Ebadollah S. Mahmoodian:
The Chromatic Number of Finite Group Cayley Tables. Electron. J. Comb. 26(1): 1 (2019)- 2018
- [j38]Mojtaba Abdolmaleki, Joan P. Hutchinson, S. Gh. Ilchi, Ebadollah S. Mahmoodian, Naoki Matsumoto, Mohammad Amin Shabani:
On Uniquely k-List Colorable Planar Graphs, Graphs on Surfaces, and Regular Graphs. Graphs Comb. 34(3): 383-394 (2018) - 2016
- [j37]A. G. Chegini, Morteza Hasanvand, Ebadollah S. Mahmoodian, Farokhlagha Moazami:
The square chromatic number of the torus. Discret. Math. 339(2): 447-456 (2016) - [j36]Nazli Besharati, Luis A. Goddyn, Ebadollah S. Mahmoodian, M. Mortezaeefar:
On the chromatic number of Latin square graphs. Discret. Math. 339(11): 2613-2619 (2016) - 2015
- [j35]Mohammad Mahdian, Ebadollah S. Mahmoodian:
Sudoku Rectangle Completion (Extended Abstract). Electron. Notes Discret. Math. 49: 747-755 (2015) - 2014
- [j34]Negin Karisani, Ebadollah S. Mahmoodian, Narges K. Sobhani:
On the star arboricity of hypercubes. Australas. J Comb. 59: 282-292 (2014) - 2013
- [j33]Ebadollah S. Mahmoodian, M. S. Najafian:
Possible volumes of t-(v, t+1) Latin trades. Ars Comb. 109: 485-496 (2013) - [j32]Arash Ahadi, Nazli Besharati, Ebadollah S. Mahmoodian, M. Mortezaeefar:
Silver Block Intersection Graphs of Steiner 2-Designs. Graphs Comb. 29(4): 735-746 (2013) - 2012
- [j31]Sharareh Alipour, Ebadollah S. Mahmoodian, E. Mollaahmadi:
On decomposing complete tripartite graphs into 5-cycles. Australas. J Comb. 54: 289-302 (2012) - [j30]A. A. Khanban, Mohammad Mahdian, Ebadollah S. Mahmoodian:
A linear algebraic approach to orthogonal arrays and Latin squares. Ars Comb. 105: 3-13 (2012) - [j29]Behrooz Bagheri Gh., Diane M. Donovan, Ebadollah S. Mahmoodian:
On the existence of 3-way k-homogeneous Latin trades. Discret. Math. 312(24): 3473-3481 (2012) - 2010
- [i1]Babak Behsaz, Pooya Hatami, Ebadollah S. Mahmoodian:
On minimum vertex cover of generalized Petersen graphs. CoRR abs/1008.3208 (2010)
2000 – 2009
- 2009
- [j28]B. Javad Ebrahimi, Nafiseh Jahanbakht, Ebadollah S. Mahmoodian:
Vertex domination of generalized Petersen graphs. Discret. Math. 309(13): 4355-4361 (2009) - 2008
- [j27]Babak Behsaz, Pooya Hatami, Ebadollah S. Mahmoodian:
On minimum vertex covers of generalized Petersen graphs. Australas. J Comb. 40: 253-264 (2008) - [j26]Mohammad Ghebleh, Luis A. Goddyn, Ebadollah S. Mahmoodian, Maryam Verdian-Rizi:
Silver Cubes. Graphs Comb. 24(5): 429-442 (2008) - 2006
- [j25]Ebadollah S. Mahmoodian, Behnaz Omoomi, Yee-Hock Peng:
On the defining sets of some special graphs. Australas. J Comb. 35: 69-82 (2006) - [j24]Ebadollah S. Mahmoodian, Behnaz Omoomi, Nasrin Soltankhah:
Smallest defining number of r-regular k-chromatic graphs: r 1 k. Ars Comb. 78 (2006) - 2005
- [j23]Nasrin Soltankhah, Ebadollah S. Mahmoodian:
On defining numbers of k-chromatic k-regular graphs. Ars Comb. 76 (2005) - [j22]Mahya Ghandehari, Hamed Hatami, Ebadollah S. Mahmoodian:
On the size of the minimum critical set of a Latin square. Discret. Math. 293(1-3): 121-127 (2005) - 2004
- [j21]Peyman Afshani, Hamed Hatami, Ebadollah S. Mahmoodian:
On the spectrum of the forced matching number of graphs. Australas. J Comb. 30: 147-160 (2004) - [j20]Peter Adams, Mohammad Mahdian, Ebadollah S. Mahmoodian:
On the forced matching numbers of bipartite graphs. Discret. Math. 281(1-3): 1-12 (2004) - 2003
- [j19]Richard Bean, Ebadollah S. Mahmoodian:
A new bound on the size of the largest critical set in a Latin square. Discret. Math. 267(1-3): 13-21 (2003) - 2002
- [j18]Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Ebadollah S. Mahmoodian:
The three-way intersection problem for latin squares. Discret. Math. 243(1-3): 1-19 (2002) - 2001
- [j17]Ebadollah S. Mahmoodian, Nasrin Soltankhah:
A linear algebraic approach to directed designs. Australas. J Comb. 23: 119-134 (2001) - [j16]Mohammad Ghebleh, Ebadollah S. Mahmoodian:
On Uniquely List Colorable Graphs. Ars Comb. 59 (2001) - 2000
- [j15]Mohammad Taghi Hajiaghayi, Ebadollah S. Mahmoodian, Seyed Vahab Mirrokni, Amin Saberi, Ruzbeh Tusserkani:
On the simultaneous edge-coloring conjecture. Discret. Math. 216(1-3): 267-272 (2000) - [j14]Mohammad Mahdian, Ebadollah S. Mahmoodian, Amin Saberi, Mohammad R. Salavatipour, Ruzbeh Tusserkani:
On a conjecture of Keedwell and the cycle double cover conjecture. Discret. Math. 216(1-3): 287-292 (2000)
1990 – 1999
- 1999
- [j13]Ebadollah S. Mahmoodian, Nasrin Soltankhah, Anne Penfold Street:
On defining sets of directed designs. Australas. J Comb. 19: 179-190 (1999) - [j12]Mohammad Mahdian, Ebadollah S. Mahmoodian:
A Characterization of Uniquely 2-List Colorable Graphs. Ars Comb. 51 (1999) - [j11]Ebadollah S. Mahmoodian, Eric Mendelsohn:
On defining numbers of vertex colouring of regular graphs. Discret. Math. 197-198: 543-554 (1999) - 1997
- [j10]Ebadollah S. Mahmoodian, G. H. John van Rees:
Critical sets in back circulant Latin rectangles. Australas. J Comb. 16: 45-50 (1997) - [j9]Ebadollah S. Mahmoodian, Reza Naserasr, Manouchehr Zaker:
Defining sets in vertex colorings of graphs and latin rectangles. Discret. Math. 167-168: 451-460 (1997) - [j8]Saieed Akbari, Mehdi Behzad, Hossein Hajiabolhassan, Ebadollah S. Mahmoodian:
Uniquely Total Colorable Graphs. Graphs Comb. 13(4): 305-314 (1997) - 1994
- [j7]Mehdi Behzad, Ebadollah S. Mahmoodian:
Eccentric sequences and triangle sequences of block designs. Discret. Math. 127(1-3): 47-56 (1994) - 1993
- [j6]Ed Dawson, Ebadollah S. Mahmoodian, Alan Rahilly:
Orthogonal arrays and ordered threshold schemes. Australas. J Comb. 8: 27-44 (1993) - [j5]Charles J. Colbourn, Ebadollah S. Mahmoodian:
Support sizes of sixfold triple systems. Discret. Math. 115(1-3): 103-131 (1993) - [j4]Elizabeth J. Billington, Ebadollah S. Mahmoodian:
Multi-Set designs and numbers of common triples. Graphs Comb. 9(2-4): 105-115 (1993) - 1992
- [j3]Ebadollah S. Mahmoodian, M. Shirdarreh:
Some new families of simple t-designs. Australas. J Comb. 5: 159-168 (1992) - [j2]Ebadollah S. Mahmoodian, Nasrin Soltankhah:
On the existence of (v, k, t) trades. Australas. J Comb. 6: 279-292 (1992) - 1990
- [j1]Charles J. Colbourn, Ebadollah S. Mahmoodian:
The spectrum of support sizes for threefold triple systems. Discret. Math. 83(1): 9-19 (1990)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
