| |
| 2008 | ||
|---|---|---|
| 9 | Manouchehr Zaker: Greedy Defining Sets in Latin Squares. Ars Comb. 89: (2008) | |
| 8 | EE | Manouchehr Zaker: New bounds for the chromatic number of graphs. Journal of Graph Theory 58(2): 110-122 (2008) |
| 2007 | ||
| 7 | EE | Manouchehr Zaker: Inequalities for the Grundy chromatic number of graphs. Discrete Applied Mathematics 155(18): 2567-2572 (2007) |
| 6 | EE | Manouchehr Zaker: Maximum transversal in partial Latin squares and rainbow matchings. Discrete Applied Mathematics 155(4): 558-565 (2007) |
| 2006 | ||
| 5 | EE | Manouchehr Zaker: Results on the Grundy chromatic number of graphs. Discrete Mathematics 306(23): 3166-3173 (2006) |
| 4 | EE | Mekkia Kouider, Manouchehr Zaker: Bounds for the b-chromatic number of some families of graphs. Discrete Mathematics 306(7): 617-623 (2006) |
| 3 | EE | Manouchehr Zaker: Greedy defining sets in graphs and Latin squares. Electronic Notes in Discrete Mathematics 24: 299-302 (2006) |
| 1999 | ||
| 2 | EE | Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani, Manouchehr Zaker: A characterization of uniquely vertex colorable graphs using minimal defining sets. Discrete Mathematics 199(1-3): 233-236 (1999) |
| 1997 | ||
| 1 | EE | Ebadollah S. Mahmoodian, Reza Naserasr, Manouchehr Zaker: Defining sets in vertex colorings of graphs and latin rectangles. Discrete Mathematics 167-168: 451-460 (1997) |
| 1 | Hossein Hajiabolhassan | [2] |
| 2 | Mekkia Kouider | [4] |
| 3 | Ebadollah S. Mahmoodian | [1] |
| 4 | Mojtaba L. Mehrabadi | [2] |
| 5 | Reza Naserasr | [1] |
| 6 | Ruzbeh Tusserkani | [2] |