Defining sets in vertex colorings of graphs and latin rectangles. - Ebadollah S. Mahmoodian; Reza Naserasr; Manouchehr Zaker (Discret. Math., 1997)

A characterization of uniquely vertex colorable graphs using minimal defining sets. - Hossein Hajiabolhassan; Mojtaba L. Mehrabadi; Ruzbeh Tusserkani; Manouchehr Zaker (Discret. Math., 1999)

Greedy defining sets of graphs. - Manouchehr Zaker (Australas. J Comb., 2001)

Grundy chromatic number of the complement of bipartite graphs. - Manouchehr Zaker (Australas. J Comb., 2005)

Bounds for the b-chromatic number of some families of graphs. - Mekkia Kouider; Manouchehr Zaker (Discret. Math., 2006)

Results on the Grundy chromatic number of graphs. - Manouchehr Zaker (Discret. Math., 2006)

Greedy defining sets in graphs and Latin squares. - Manouchehr Zaker (Electron. Notes Discret. Math., 2006)

Maximum transversal in partial Latin squares and rainbow matchings. - Manouchehr Zaker (Discret. Appl. Math., 2007)

Inequalities for the Grundy chromatic number of graphs. - Manouchehr Zaker (Discret. Appl. Math., 2007)

Greedy Defining Sets in Latin Squares. - Manouchehr Zaker (Ars Comb., 2008)

New bounds for the chromatic number of graphs. - Manouchehr Zaker (J. Graph Theory, 2008)

On (δ, χ)-Bounded Families of Graphs. - András Gyárfás; Manouchehr Zaker (Electron. J. Comb., 2011)

Bounds for chromatic number in terms of even-girth and booksize. - Manouchehr Zaker (Discret. Math., 2011)

On lower bounds for the chromatic number in terms of vertex degree. - Manouchehr Zaker (Discret. Math., 2011)

On dynamic monopolies of graphs: The average and strict majority thresholds. - Kaveh Khoshkhah; Hossein Soltani; Manouchehr Zaker (Discret. Optim., 2012)

On dynamic monopolies of graphs with general thresholds. - Manouchehr Zaker (Discret. Math., 2012)

Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs. - Manouchehr Zaker (Discret. Appl. Math., 2013)

A Study of Monopolies in Graphs. - Kaveh Khoshkhah; M. Nemati; Hossein Soltani; Manouchehr Zaker (Graphs Comb., 2013)

More results on greedy defining sets. - Manouchehr Zaker (Ars Comb., 2014)

Dynamic monopolies in directed graphs: The spread of unilateral influence in social networks. - Kaveh Khoshkhah; Hossein Soltani; Manouchehr Zaker (Discret. Appl. Math., 2014)

Lower bounds for the independence and k-independence number of graphs using the concept of degenerate degrees. - Manouchehr Zaker (Discret. Appl. Math., 2016)

First-Fit colorings of graphs with no cycles of a prescribed even length. - Manouchehr Zaker; Hossein Soltani (J. Comb. Optim., 2016)

First-Fit coloring of Cartesian product graphs and its defining sets. - Manouchehr Zaker (Contributions Discret. Math., 2017)

More bounds for the Grundy number of graphs. - Zixing Tang; Baoyindureng Wu; Lin Hu; Manouchehr Zaker (J. Comb. Optim., 2017)

A note on orientation and chromatic number of graphs. - Manouchehr Zaker (J. Comb. Optim., 2017)

Partial vertex covers and the complexity of some problems concerning static and dynamic monopolies. - Hossein Soltani; Manouchehr Zaker (CoRR, 2018)

Weak dynamic monopolies in social graphs. - Mitra Nemati Andavari; Manouchehr Zaker (CoRR, 2018)

A New Vertex Coloring Heuristic and Corresponding Chromatic Number. - Manouchehr Zaker (Algorithmica, 2020)

On irreversible spread of influence in edge-weighted graphs. - Manouchehr Zaker (Contributions Discret. Math., 2020)

More relations between $λ$-labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs. - Manouchehr Zaker (CoRR, 2021)

On Grundy and b-Chromatic Number of Some Families of Graphs: A Comparative Study. - Zoya Masih; Manouchehr Zaker (Graphs Comb., 2021)

Some comparative results concerning the Grundy and b-chromatic number of graphs. - Zoya Masih; Manouchehr Zaker (Discret. Appl. Math., 2022)

A Comparison of the Grundy and b-Chromatic Number of K2,t -Free Graphs. - Zoia Masih; Manouchehr Zaker (Graphs Comb., 2023)

More results on the z-chromatic number of graphs. - Abbas Khaleghi; Manouchehr Zaker (Discret. Appl. Math., 2023)

More algorithmic results for problems of spread of influence in edge-weighted graphs with and without incentives. - Siavash Askari; Manouchehr Zaker (CoRR, 2024)

O(VE) time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with sufficiently large girth. - Manouchehr Zaker (CoRR, 2024)

On z-coloring and b*-coloring of graphs as improved variants of the b-coloring. - Manouchehr Zaker (CoRR, 2024)

Spread of influence with incentives in edge-weighted graphs with emphasis on some families of graphs. - Siavash Askari; Manouchehr Zaker (J. Comb. Optim., 2024)

Upper bounds for some graph invariants in terms of blocks and cut-vertices. - Manouchehr Zaker (Discret. Appl. Math., 2025)

O(VE) time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with large girth. - Manouchehr Zaker (Discret. Math., 2025)