Manouchehr Zaker

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 20

Top Topics

Subgraph Isomorphism

Top Venues

J. Comb. Optim.

Discret. Appl. Math.

Contributions Discret. Math.

Publications

Siavash Askari, Manouchehr Zaker
Spread of influence with incentives in edge-weighted graphs with emphasis on some families of graphs. J. Comb. Optim. 47 (4) (2024)
Manouchehr Zaker
O(VE) time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with sufficiently large girth. CoRR (2024)
Siavash Askari, Manouchehr Zaker
More algorithmic results for problems of spread of influence in edge-weighted graphs with and without incentives. CoRR (2024)
Abbas Khaleghi, Manouchehr Zaker
More results on the z-chromatic number of graphs. Discret. Appl. Math. 338 (2023)
Zoia Masih, Manouchehr Zaker
-Free Graphs. Graphs Comb. 39 (1) (2023)
Abbas Khaleghi, Manouchehr Zaker
More results on the z-chromatic number of graphs. CoRR (2023)
Zoya Masih, Manouchehr Zaker
Some comparative results concerning the Grundy and b-chromatic number of graphs. Discret. Appl. Math. 306 (2022)
Zoya Masih, Manouchehr Zaker
On Grundy and b-Chromatic Number of Some Families of Graphs: A Comparative Study. Graphs Comb. 37 (2) (2021)
Manouchehr Zaker
More relations between $λ$-labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs. CoRR (2021)
Manouchehr Zaker
A new vertex coloring heuristic and corresponding chromatic number. CoRR (2020)
Manouchehr Zaker
On irreversible spread of influence in edge-weighted graphs. Contributions Discret. Math. 15 (2) (2020)
Manouchehr Zaker
A New Vertex Coloring Heuristic and Corresponding Chromatic Number. Algorithmica 82 (9) (2020)
Manouchehr Zaker
On irreversible spread of influence in edge-weighted graphs. CoRR (2019)
Mitra Nemati Andavari, Manouchehr Zaker
Weak dynamic monopolies in social graphs. CoRR (2018)
Hossein Soltani, Manouchehr Zaker
Partial vertex covers and the complexity of some problems concerning static and dynamic monopolies. CoRR (2018)
Zixing Tang, Baoyindureng Wu, Lin Hu, Manouchehr Zaker
More bounds for the Grundy number of graphs. J. Comb. Optim. 33 (2) (2017)
Manouchehr Zaker
A note on orientation and chromatic number of graphs. J. Comb. Optim. 34 (2) (2017)
Manouchehr Zaker
First-Fit coloring of Cartesian product graphs and its defining sets. Contributions Discret. Math. 12 (1) (2017)
Manouchehr Zaker
Lower bounds for the independence and k-independence number of graphs using the concept of degenerate degrees. Discret. Appl. Math. 203 (2016)
Manouchehr Zaker, Hossein Soltani
First-Fit colorings of graphs with no cycles of a prescribed even length. J. Comb. Optim. 32 (3) (2016)
Manouchehr Zaker
More results on greedy defining sets. Ars Comb. 114 (2014)
Kaveh Khoshkhah, Hossein Soltani, Manouchehr Zaker
Dynamic monopolies in directed graphs: The spread of unilateral influence in social networks. Discret. Appl. Math. 171 (2014)
Kaveh Khoshkhah, M. Nemati, Hossein Soltani, Manouchehr Zaker
A Study of Monopolies in Graphs. Graphs Comb. 29 (5) (2013)
Manouchehr Zaker
Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs. Discret. Appl. Math. 161 (16-17) (2013)
Manouchehr Zaker
Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs CoRR (2012)
Kaveh Khoshkhah, Hossein Soltani, Manouchehr Zaker
On dynamic monopolies of graphs: the average and strict majority thresholds CoRR (2012)
Kaveh Khoshkhah, Hossein Soltani, Manouchehr Zaker
On dynamic monopolies of graphs: The average and strict majority thresholds. Discret. Optim. 9 (2) (2012)
Kaveh Khoshkhah, Hossein Soltani, Manouchehr Zaker
Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks CoRR (2012)
Manouchehr Zaker
On dynamic monopolies of graphs with general thresholds. Discret. Math. 312 (6) (2012)
András Gyárfás, Manouchehr Zaker
On (δ, χ)-Bounded Families of Graphs. Electron. J. Comb. 18 (1) (2011)
Manouchehr Zaker
Bounds for chromatic number in terms of even-girth and booksize. Discret. Math. 311 (2-3) (2011)
Manouchehr Zaker
On dynamic monopolies of graphs with general thresholds CoRR (2011)
Manouchehr Zaker
On lower bounds for the chromatic number in terms of vertex degree. Discret. Math. 311 (14) (2011)
Manouchehr Zaker
Greedy Defining Sets in Latin Squares. Ars Comb. 89 (2008)
Manouchehr Zaker
New bounds for the chromatic number of graphs. J. Graph Theory 58 (2) (2008)
Manouchehr Zaker
Maximum transversal in partial Latin squares and rainbow matchings. Discret. Appl. Math. 155 (4) (2007)
Manouchehr Zaker
Inequalities for the Grundy chromatic number of graphs. Discret. Appl. Math. 155 (18) (2007)
Manouchehr Zaker
Greedy defining sets in graphs and Latin squares. Electron. Notes Discret. Math. 24 (2006)
Manouchehr Zaker
Results on the Grundy chromatic number of graphs. Discret. Math. 306 (23) (2006)
Mekkia Kouider, Manouchehr Zaker
Bounds for the b-chromatic number of some families of graphs. Discret. Math. 306 (7) (2006)
Manouchehr Zaker
Grundy chromatic number of the complement of bipartite graphs. Australas. J Comb. 31 (2005)
Manouchehr Zaker
Greedy defining sets of graphs. Australas. J Comb. 23 (2001)
Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani, Manouchehr Zaker
A characterization of uniquely vertex colorable graphs using minimal defining sets. Discret. Math. 199 (1-3) (1999)
Ebadollah S. Mahmoodian, Reza Naserasr, Manouchehr Zaker
Defining sets in vertex colorings of graphs and latin rectangles. Discret. Math. (1997)