- Publications
- Influence

Claim Your Author Page

Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications.

- Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Ebadollah S. Mahmoodian
- Discrete Mathematics
- 2002

The set of integers k for which there exist three latin squares of order n having precisely k cells identical, with their remaining n(2) - k cells different in all three latin squares, denoted by… (More)

- Peyman Afshani, Hamed Hatami, Ebadollah S. Mahmoodian
- Australasian J. Combinatorics
- 2004

Let $G$ be a graph that admits a perfect matching. A {\sf forcing set} for a perfect matching $M$ of $G$ is a subset $S$ of $M$, such that $S$ is contained in no other perfect matching of $G$. This… (More)

- Mohammad Mahdian, Ebadollah S. Mahmoodian
- Ars Comb.
- 1999

Let G be a graph with vertices, and let S 1 ; S 2 ; : : : ; S be a list of colors on its vertices, each of size k. If there exists a unique proper coloring for G from this list of colors, then G is… (More)

- Behrooz Bagheri Gh., Diane Donovan, Ebadollah S. Mahmoodian
- Discrete Mathematics
- 2012

A µ -way Latin trade of volume s is a collection of µ partial Latin squares T 1 , T 2 , ? , T µ , containing exactly the same s filled cells, such that, if cell ( i , j ) is filled, it contains a… (More)

- Ebadollah S. Mahmoodian, Reza Naserasr, Manouchehr Zaker
- Discrete Mathematics
- 1997

Abstract In a given graph G , a set of vertices S with an assignment of colors is said to be a defining set of the vertex coloring of G , if there exists a unique extension of the colors of S to a χ… (More)

- Peter Adams, Mohammad Mahdian, Ebadollah S. Mahmoodian
- Discrete Mathematics
- 2004

Let G be a graph that admits a perfect matching. A forcing set for a perfect matching M of G is a subset S of M, such that S is contained in no other perfect matching of G. This notion has arisen in… (More)

- Ebadollah S. Mahmoodian, Eric Mendelsohn
- Discrete Mathematics
- 1999

- Mohammad Ghebleh, Ebadollah S. Mahmoodian
- Ars Comb.
- 1999

Let G be a graph with n vertices and suppose that for each vertex v in G, there exists a list of k colors L(v), such that there is a unique proper coloring for G from this collection of lists, then G… (More)

A result of Sotteau on the necessary and sufficient conditions for decomposing the complete bipartite graphs into even cycles has been shown in many occasions, that it is a very important tool in the… (More)

There are many long-standing conjectures related with some labellings of trees. It is important to connect labellings that are related with conjectures. We find some connections between known… (More)