Manouchehr Zaker

49 papers Journal 49
YearRankTypeTitle / Venue / Authors
2025 J jnl
More algorithmic results for problems of spread of influence in edge-weighted graphs with and without incentives: More algorithmic results for problems of spread of influence.
Contributions Discret. Math.
Manouchehr Zaker, Siavash Askari
2025 J jnl
O(VE) time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with large girth.
Discret. Math.
Manouchehr Zaker
2025 J jnl
On z-coloring and b∗-coloring of graphs as improved variants of the b-coloring.
Discret. Appl. Math.
Manouchehr Zaker
2025 J jnl
Upper bounds for some graph invariants in terms of blocks and cut-vertices.
Discret. Appl. Math.
Manouchehr Zaker
2024 J jnl
More algorithmic results for problems of spread of influence in edge-weighted graphs with and without incentives.
CoRR
Siavash Askari, Manouchehr Zaker
2024 J jnl
O(VE) time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with sufficiently large girth.
CoRR
Manouchehr Zaker
2024 J jnl
On z-coloring and b
CoRR
Manouchehr Zaker
2024 J jnl
Spread of influence with incentives in edge-weighted graphs with emphasis on some families of graphs.
J. Comb. Optim.
Siavash Askari, Manouchehr Zaker
2023 J jnl
A Comparison of the Grundy and b-Chromatic Number of K
Graphs Comb.
Zoia Masih, Manouchehr Zaker
2023 J jnl
More results on the z-chromatic number of graphs.
CoRR
Abbas Khaleghi, Manouchehr Zaker
2023 J jnl
More results on the z-chromatic number of graphs.
Discret. Appl. Math.
Abbas Khaleghi, Manouchehr Zaker
2022 J jnl
Some comparative results concerning the Grundy and b-chromatic number of graphs.
Discret. Appl. Math.
Zoya Masih, Manouchehr Zaker
2021 J jnl
More relations between $λ$-labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs.
CoRR
Manouchehr Zaker
2021 J jnl
On Grundy and b-Chromatic Number of Some Families of Graphs: A Comparative Study.
Graphs Comb.
Zoya Masih, Manouchehr Zaker
2020 J jnl
A New Vertex Coloring Heuristic and Corresponding Chromatic Number.
Algorithmica
Manouchehr Zaker
2020 J jnl
A new vertex coloring heuristic and corresponding chromatic number.
CoRR
Manouchehr Zaker
2020 J jnl
On irreversible spread of influence in edge-weighted graphs.
Contributions Discret. Math.
Manouchehr Zaker
2019 J jnl
On irreversible spread of influence in edge-weighted graphs.
CoRR
Manouchehr Zaker
2018 J jnl
Partial vertex covers and the complexity of some problems concerning static and dynamic monopolies.
CoRR
Hossein Soltani, Manouchehr Zaker
2018 J jnl
Weak dynamic monopolies in social graphs.
CoRR
Mitra Nemati Andavari, Manouchehr Zaker
2017 J jnl
A note on orientation and chromatic number of graphs.
J. Comb. Optim.
Manouchehr Zaker
2017 J jnl
First-Fit coloring of Cartesian product graphs and its defining sets.
Contributions Discret. Math.
Manouchehr Zaker
2017 J jnl
More bounds for the Grundy number of graphs.
J. Comb. Optim.
Zixing Tang, Baoyindureng Wu, Lin Hu, Manouchehr Zaker
2016 J jnl
First-Fit colorings of graphs with no cycles of a prescribed even length.
J. Comb. Optim.
Manouchehr Zaker, Hossein Soltani
2016 J jnl
Lower bounds for the independence and k-independence number of graphs using the concept of degenerate degrees.
Discret. Appl. Math.
Manouchehr Zaker
2014 J jnl
Dynamic monopolies in directed graphs: The spread of unilateral influence in social networks.
Discret. Appl. Math.
Kaveh Khoshkhah, Hossein Soltani, Manouchehr Zaker
2014 J jnl
More results on greedy defining sets.
Ars Comb.
Manouchehr Zaker
2013 J jnl
A Study of Monopolies in Graphs.
Graphs Comb.
Kaveh Khoshkhah, M. Nemati, Hossein Soltani, Manouchehr Zaker
2013 J jnl
Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs.
Discret. Appl. Math.
Manouchehr Zaker
2012 J jnl
Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks
CoRR
Kaveh Khoshkhah, Hossein Soltani, Manouchehr Zaker
2012 J jnl
Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
CoRR
Manouchehr Zaker
2012 J jnl
On dynamic monopolies of graphs with general thresholds.
Discret. Math.
Manouchehr Zaker
2012 J jnl
On dynamic monopolies of graphs: The average and strict majority thresholds.
Discret. Optim.
Kaveh Khoshkhah, Hossein Soltani, Manouchehr Zaker
2012 J jnl
On dynamic monopolies of graphs: the average and strict majority thresholds
CoRR
Kaveh Khoshkhah, Hossein Soltani, Manouchehr Zaker
2011 J jnl
Bounds for chromatic number in terms of even-girth and booksize.
Discret. Math.
Manouchehr Zaker
2011 J jnl
On (δ, χ)-Bounded Families of Graphs.
Electron. J. Comb.
András Gyárfás, Manouchehr Zaker
2011 J jnl
On dynamic monopolies of graphs with general thresholds
CoRR
Manouchehr Zaker
2011 J jnl
On lower bounds for the chromatic number in terms of vertex degree.
Discret. Math.
Manouchehr Zaker
2008 J jnl
Greedy Defining Sets in Latin Squares.
Ars Comb.
Manouchehr Zaker
2008 J jnl
New bounds for the chromatic number of graphs.
J. Graph Theory
Manouchehr Zaker
2007 J jnl
Inequalities for the Grundy chromatic number of graphs.
Discret. Appl. Math.
Manouchehr Zaker
2007 J jnl
Maximum transversal in partial Latin squares and rainbow matchings.
Discret. Appl. Math.
Manouchehr Zaker
2006 J jnl
Bounds for the b-chromatic number of some families of graphs.
Discret. Math.
Mekkia Kouider, Manouchehr Zaker
2006 J jnl
Greedy defining sets in graphs and Latin squares.
Electron. Notes Discret. Math.
Manouchehr Zaker
2006 J jnl
Results on the Grundy chromatic number of graphs.
Discret. Math.
Manouchehr Zaker
2005 J jnl
Grundy chromatic number of the complement of bipartite graphs.
Australas. J Comb.
Manouchehr Zaker
2001 J jnl
Greedy defining sets of graphs.
Australas. J Comb.
Manouchehr Zaker
1999 J jnl
A characterization of uniquely vertex colorable graphs using minimal defining sets.
Discret. Math.
Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani, Manouchehr Zaker
1997 J jnl
Defining sets in vertex colorings of graphs and latin rectangles.
Discret. Math.
Ebadollah S. Mahmoodian, Reza Naserasr, Manouchehr Zaker