Manouchehr Zaker

According to our database1, Manouchehr Zaker authored at least 35 papers between 1997 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
More algorithmic results for problems of spread of influence in edge-weighted graphs with and without incentives.
CoRR, 2024

2023
More results on the z-chromatic number of graphs.
Discret. Appl. Math., October, 2023

A Comparison of the Grundy and b-Chromatic Number of K<sub>2,t</sub> -Free Graphs.
Graphs Comb., February, 2023

2022
Some comparative results concerning the Grundy and b-chromatic number of graphs.
Discret. Appl. Math., 2022

2021
On Grundy and b-Chromatic Number of Some Families of Graphs: A Comparative Study.
Graphs Comb., 2021

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

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

A New Vertex Coloring Heuristic and Corresponding Chromatic Number.
Algorithmica, 2020

2018
Weak dynamic monopolies in social graphs.
CoRR, 2018

Partial vertex covers and the complexity of some problems concerning static and dynamic monopolies.
CoRR, 2018

2017
A note on orientation and chromatic number of graphs.
J. Comb. Optim., 2017

More bounds for the Grundy number of graphs.
J. Comb. Optim., 2017

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

2016
First-Fit colorings of graphs with no cycles of a prescribed even length.
J. Comb. Optim., 2016

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

2014
Dynamic monopolies in directed graphs: The spread of unilateral influence in social networks.
Discret. Appl. Math., 2014

More results on greedy defining sets.
Ars Comb., 2014

2013
A Study of Monopolies in Graphs.
Graphs Comb., 2013

Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs.
Discret. Appl. Math., 2013

2012
On dynamic monopolies of graphs with general thresholds.
Discret. Math., 2012

On dynamic monopolies of graphs: The average and strict majority thresholds.
Discret. Optim., 2012

2011
On lower bounds for the chromatic number in terms of vertex degree.
Discret. Math., 2011

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

On (δ, χ)-Bounded Families of Graphs.
Electron. J. Comb., 2011

2008
New bounds for the chromatic number of graphs.
J. Graph Theory, 2008

Greedy Defining Sets in Latin Squares.
Ars Comb., 2008

2007
Inequalities for the Grundy chromatic number of graphs.
Discret. Appl. Math., 2007

Maximum transversal in partial Latin squares and rainbow matchings.
Discret. Appl. Math., 2007

2006
Greedy defining sets in graphs and Latin squares.
Electron. Notes Discret. Math., 2006

Results on the Grundy chromatic number of graphs.
Discret. Math., 2006

Bounds for the b-chromatic number of some families of graphs.
Discret. Math., 2006

2005
Grundy chromatic number of the complement of bipartite graphs.
Australas. J Comb., 2005

2001
Greedy defining sets of graphs.
Australas. J Comb., 2001

1999
A characterization of uniquely vertex colorable graphs using minimal defining sets.
Discret. Math., 1999

1997
Defining sets in vertex colorings of graphs and latin rectangles.
Discret. Math., 1997


  Loading...