Ebadollah S. Mahmoodian

According to our database, Ebadollah S. Mahmoodian authored at least 40 papers between 1990 and 2019.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2019

The Chromatic Number of Finite Group Cayley Tables.

Luis A. Goddyn, Kevin Halasz, Ebadollah S. Mahmoodian

Electron. J. Comb., 2019

2018

On Uniquely k-List Colorable Planar Graphs, Graphs on Surfaces, and Regular Graphs.

Mojtaba Abdolmaleki, Joan P. Hutchinson, S. Gh. Ilchi, Ebadollah S. Mahmoodian, Naoki Matsumoto, Mohammad Amin Shabani

Graphs Comb., 2018

2016

The square chromatic number of the torus.

A. G. Chegini, Morteza Hasanvand, Ebadollah S. Mahmoodian, Farokhlagha Moazami

Discret. Math., 2016

On the chromatic number of Latin square graphs.

Nazli Besharati, Luis A. Goddyn, Ebadollah S. Mahmoodian, M. Mortezaeefar

Discret. Math., 2016

2015

Sudoku Rectangle Completion (Extended Abstract).

Mohammad Mahdian, Ebadollah S. Mahmoodian

Electron. Notes Discret. Math., 2015

2014

On the star arboricity of hypercubes.

Negin Karisani, Ebadollah S. Mahmoodian, Narges K. Sobhani

Australas. J Comb., 2014

2013

Silver Block Intersection Graphs of Steiner 2-Designs.

Arash Ahadi, Nazli Besharati, Ebadollah S. Mahmoodian, M. Mortezaeefar

Graphs Comb., 2013

Possible volumes of t-(v, t+1) Latin trades.

Ebadollah S. Mahmoodian, M. S. Najafian

Ars Comb., 2013

2012

On the existence of 3-way k-homogeneous Latin trades.

Behrooz Bagheri Gh., Diane M. Donovan, Ebadollah S. Mahmoodian

Discret. Math., 2012

A linear algebraic approach to orthogonal arrays and Latin squares.

A. A. Khanban, Mohammad Mahdian, Ebadollah S. Mahmoodian

Ars Comb., 2012

On decomposing complete tripartite graphs into 5-cycles.

Sharareh Alipour, Ebadollah S. Mahmoodian, E. Mollaahmadi

Australas. J Comb., 2012

2010

On minimum vertex cover of generalized Petersen graphs

Babak Behsaz, Pooya Hatami, Ebadollah S. Mahmoodian

CoRR, 2010

2009

Vertex domination of generalized Petersen graphs.

B. Javad Ebrahimi, Nafiseh Jahanbakht, Ebadollah S. Mahmoodian

Discret. Math., 2009

2008

Silver Cubes.

Mohammad Ghebleh, Luis A. Goddyn, Ebadollah S. Mahmoodian, Maryam Verdian-Rizi

Graphs Comb., 2008

On minimum vertex covers of generalized Petersen graphs.

Babak Behsaz, Pooya Hatami, Ebadollah S. Mahmoodian

Australas. J Comb., 2008

2006

Smallest defining number of r-regular k-chromatic graphs: r ¹ k.

Ebadollah S. Mahmoodian, Behnaz Omoomi, Nasrin Soltankhah

Ars Comb., 2006

On the defining sets of some special graphs.

Ebadollah S. Mahmoodian, Behnaz Omoomi, Yee-Hock Peng

Australas. J Comb., 2006

2005

On the size of the minimum critical set of a Latin square.

Mahya Ghandehari, Hamed Hatami, Ebadollah S. Mahmoodian

Discret. Math., 2005

On defining numbers of k-chromatic k-regular graphs.

Nasrin Soltankhah, Ebadollah S. Mahmoodian

Ars Comb., 2005

2004

On the forced matching numbers of bipartite graphs.

Peter Adams, Mohammad Mahdian, Ebadollah S. Mahmoodian

Discret. Math., 2004

On the spectrum of the forced matching number of graphs.

Peyman Afshani, Hamed Hatami, Ebadollah S. Mahmoodian

Australas. J Comb., 2004

2003

A new bound on the size of the largest critical set in a Latin square.

Richard Bean, Ebadollah S. Mahmoodian

Discret. Math., 2003

2002

The three-way intersection problem for latin squares.

Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Ebadollah S. Mahmoodian

Discret. Math., 2002

2001

On Uniquely List Colorable Graphs.

Mohammad Ghebleh, Ebadollah S. Mahmoodian

Ars Comb., 2001

A linear algebraic approach to directed designs.

Ebadollah S. Mahmoodian, Nasrin Soltankhah

Australas. J Comb., 2001

2000

On a conjecture of Keedwell and the cycle double cover conjecture.

Mohammad Mahdian, Ebadollah S. Mahmoodian, Amin Saberi, Mohammad R. Salavatipour, Ruzbeh Tusserkani

Discret. Math., 2000

On the simultaneous edge-coloring conjecture.

Mohammad Taghi Hajiaghayi, Ebadollah S. Mahmoodian, Seyed Vahab Mirrokni, Amin Saberi, Ruzbeh Tusserkani

Discret. Math., 2000

1999

On defining numbers of vertex colouring of regular graphs.

Ebadollah S. Mahmoodian, Eric Mendelsohn

Discret. Math., 1999

A Characterization of Uniquely 2-List Colorable Graphs.

Mohammad Mahdian, Ebadollah S. Mahmoodian

Ars Comb., 1999

On defining sets of directed designs.

Ebadollah S. Mahmoodian, Nasrin Soltankhah, Anne Penfold Street

Australas. J Comb., 1999

1997

Uniquely Total Colorable Graphs.

Saieed Akbari, Mehdi Behzad, Hossein Hajiabolhassan, Ebadollah S. Mahmoodian

Graphs Comb., 1997

Defining sets in vertex colorings of graphs and latin rectangles.

Ebadollah S. Mahmoodian, Reza Naserasr, Manouchehr Zaker

Discret. Math., 1997

Critical sets in back circulant Latin rectangles.

Ebadollah S. Mahmoodian, G. H. John van Rees

Australas. J Comb., 1997

1994

Eccentric sequences and triangle sequences of block designs.

Mehdi Behzad, Ebadollah S. Mahmoodian

Discret. Math., 1994

1993

Multi-Set designs and numbers of common triples.

Elizabeth J. Billington, Ebadollah S. Mahmoodian

Graphs Comb., 1993

Support sizes of sixfold triple systems.

Charles J. Colbourn, Ebadollah S. Mahmoodian

Discret. Math., 1993

Orthogonal arrays and ordered threshold schemes.

Ed Dawson, Ebadollah S. Mahmoodian, Alan Rahilly

Australas. J Comb., 1993

1992

On the existence of (v, k, t) trades.

Ebadollah S. Mahmoodian, Nasrin Soltankhah

Australas. J Comb., 1992

Some new families of simple t-designs.

Ebadollah S. Mahmoodian, M. Shirdarreh

Australas. J Comb., 1992

1990

The spectrum of support sizes for threefold triple systems.

Charles J. Colbourn, Ebadollah S. Mahmoodian

Discret. Math., 1990