| Results on the Grundy chromatic number of graphs M Zaker Discrete mathematics 306 (23), 3166-3173, 2006 | 99 | 2006 |
| Bounds for the b-chromatic number of some families of graphs M Kouider, M Zaker Discrete Mathematics 306 (7), 617-623, 2006 | 88 | 2006 |
| Defining sets in vertex colorings of graphs and Latin rectangles ES Mahmoodian, R Naserasr, M Zaker Discrete Mathematics 167, 451-460, 1997 | 77 | 1997 |
| On dynamic monopolies of graphs with general thresholds M Zaker Discrete Mathematics 312 (6), 1136-1143, 2012 | 64 | 2012 |
| Grundy chromatic number of the complement of bipartite graphs. M Zaker Australas. J Comb. 31, 325-330, 2005 | 43 | 2005 |
| A study of monopolies in graphs K Khoshkhah, M Nemati, H Soltani, M Zaker Graphs and Combinatorics 29 (5), 1417-1427, 2013 | 36 | 2013 |
| On dynamic monopolies of graphs: the average and strict majority thresholds K Khoshkhah, H Soltani, M Zaker Discrete Optimization 9 (2), 77-83, 2012 | 29 | 2012 |
| Inequalities for the Grundy chromatic number of graphs M Zaker Discrete applied mathematics 155 (18), 2567-2572, 2007 | 20 | 2007 |
| Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs M Zaker Discrete Applied Mathematics 161 (16-17), 2716-2723, 2013 | 15 | 2013 |
| Dynamic monopolies in directed graphs: The spread of unilateral influence in social networks K Khoshkhah, H Soltani, M Zaker Discrete Applied Mathematics 171, 81-89, 2014 | 14 | 2014 |
| A characterization of uniquely vertex colorable graphs using minimal defining sets H Hajiabolhassan, ML Mehrabadi, R Tusserkani, M Zaker Discrete mathematics 199 (1-3), 233-236, 1999 | 12 | 1999 |
| New bounds for the chromatic number of graphs M Zaker Journal of Graph Theory 58 (2), 110-122, 2008 | 11 | 2008 |
| Greedy defining sets of graphs M Zaker Australasian Journal of Combinatorics 23, 231-236, 2001 | 11 | 2001 |
| Some comparative results concerning the Grundy and b-chromatic number of graphs Z Masih, M Zaker Discrete Applied Mathematics 306, 1-6, 2022 | 9 | 2022 |
| A new vertex coloring heuristic and corresponding chromatic number M Zaker Algorithmica 82 (9), 2395-2414, 2020 | 7 | 2020 |
| Greedy defining sets in Latin squares M Zaker Ars Combinatoria 89, 205-222, 2008 | 7 | 2008 |
| On Grundy and b-chromatic number of some families of graphs: a comparative study Z Masih, M Zaker Graphs and Combinatorics 37, 605-620, 2021 | 4 | 2021 |
| Bounds for the b" chromatic number of some families of graphs. arXiv: math M Kouider, M Zaker Co/0506167 v1 9, 2005 | 4 | 2005 |
| On-line greedy colorings and Grundy number of graphs M Zaker Ph. D. thesis, Sharif University of Technology, Tehran, 2001 | 4 | 2001 |
| A note concerning the Grundy and -chromatic number of graphs M Zaker arXiv preprint arXiv:2003.14233, 2020 | 3 | 2020 |
