11 citations · 44 across the 22 of their papers we have counts for
22 papers
Some applications of linear algebraic methods in combinatorics
Maryam Khosravi, Ebadollah S. Mahmoodian
In this note, we intend to produce all latin squares from one of them using suitable move which is defined by small trades and do the similar work on 4-cycle systems. These problem…
A Highly Symmetric Hamilton Decomposition for Hypercubes
Farid Bouya, Ebadollah S. Mahmoodian, Modjtaba Shokrian Zini +1
A Hamilton decomposition of a graph is a partitioning of its edge set into disjoint spanning cycles. The existence of such decompositions is known for all hypercubes of even dimens…
Decomposition of complete tripartite graphs into 5-cycles using the graph adjacency matrix
Bahareh Kudarzi, E. S. Mahmoodian, Zahra Naghdabadi
The problem of decomposing a complete tripartite graph into 5-cycles was first proposed in 1995 by Mahmoodian and Mirzakhani and since then many attempts have been made to decompos…
On decomposing complete tripartite graphs into 5-cycles
M. Abdolmaleki, S. Gh. Ilchi, E. S. Mahmoodian +1
The problem of finding necessary and sufficient conditions to decompose a complete tripartite graph into 5-cycles was first considered by E.S. Mahmoodian and Maryam Mir…
On uniquely k-list colorable planar graphs, graphs on surfaces, and regular graphs
M. Abdolmaleki, J. P. Hutchinson, S. Gh. Ilchi +2
A graph is called uniquely k-list colorable (ULC) if there exists a list of colors on its vertices, say , each of size , such that…
Sudoku Rectangle Completion
Mohammad Mahdian, Ebadollah S. Mahmoodian
Over the last decade, Sudoku, a combinatorial number-placement puzzle, has become a favorite pastimes of many all around the world. In this puzzle, the task is to complete a partia…