Manouchehr Zaker

From MaRDI portal
(Redirected from Person:260060)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Upper bounds for some graph invariants in terms of blocks and cut-vertices
Discrete Applied Mathematics
2025-01-06Paper
Spread of influence with incentives in edge-weighted graphs with emphasis on some families of graphs
Journal of Combinatorial Optimization
2024-07-11Paper
Bounds for the Grundy chromatic number of graphs in terms of domination number
Bulletin of the Belgian Mathematical Society - Simon Stevin
2023-09-18Paper
More results on the \(z\)-chromatic number of graphs
Discrete Applied Mathematics
2023-08-02Paper
A comparison of the Grundy and b-chromatic number of \(K_{2,t}\)-free graphs
Graphs and Combinatorics
2023-03-09Paper
More relations between \(\lambda \)-labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs
(available as arXiv preprint)
2022-02-28Paper
On monopoly and dynamic monopoly of Cartesian product of graphs with constant thresholds.
(available as arXiv preprint)
2021-12-10Paper
Some comparative results concerning the Grundy and \(b\)-chromatic number of graphs
Discrete Applied Mathematics
2021-11-11Paper
On Grundy and b-chromatic number of some families of graphs: a comparative study
Graphs and Combinatorics
2021-03-17Paper
A new vertex coloring heuristic and corresponding chromatic number
Algorithmica
2020-09-03Paper
On irreversible spread of influence in edge-weighted graphs
(available as arXiv preprint)
2020-08-12Paper
A note concerning the Grundy and ${\rm b}$-chromatic number of graphs2020-03-31Paper
\((\delta, \chi_{\mathsf{FF}})\)-bounded families of graphs
(available as arXiv preprint)
2019-03-11Paper
On the maximum size of resistant subgraphs in graphs with given average threshold2018-07-12Paper
Partial vertex covers and the complexity of some problems concerning static and dynamic monopolies
(available as arXiv preprint)
2018-06-14Paper
First-fit coloring of Cartesian product graphs and its defining sets
(available as arXiv preprint)
2017-12-20Paper
A note on orientation and chromatic number of graphs
Journal of Combinatorial Optimization
2017-10-17Paper
Weak dynamic monopolies in social graphs
(available as arXiv preprint)
2017-07-05Paper
First-fit colorings of graphs with no cycles of a prescribed even length
Journal of Combinatorial Optimization
2016-10-12Paper
Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees
Discrete Applied Mathematics
2016-03-18Paper
On the Largest Dynamic Monopolies of Graphs with a Given Average Threshold
Canadian Mathematical Bulletin
2015-05-29Paper
More results on greedy defining sets.
(available as arXiv preprint)
2015-05-06Paper
On dynamic monopolies of graphs with probabilistic thresholds
Bulletin of the Australian Mathematical Society
2014-12-05Paper
Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks
Discrete Applied Mathematics
2014-05-06Paper
Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs
Discrete Applied Mathematics
2014-04-10Paper
A study of monopolies in graphs
Graphs and Combinatorics
2013-09-26Paper
On dynamic monopolies of graphs: the average and strict majority thresholds
Discrete Optimization
2012-09-11Paper
On dynamic monopolies of graphs with general thresholds
Discrete Mathematics
2012-04-13Paper
On lower bounds for the chromatic number in terms of vertex degree
Discrete Mathematics
2011-08-08Paper
On \((\delta, \chi)\)-bounded families of graphs
The Electronic Journal of Combinatorics
2011-06-01Paper
On \((\delta, \chi)\)-bounded families of graphs
The Electronic Journal of Combinatorics
2011-06-01Paper
Greedy defining sets in Latin squares2011-02-02Paper
Bounds for chromatic number in terms of even-girth and booksize
Discrete Mathematics
2011-01-07Paper
New bounds for the chromatic number of graphs
Journal of Graph Theory
2008-06-12Paper
Inequalities for the Grundy chromatic number of graphs
Discrete Applied Mathematics
2007-11-30Paper
Greedy defining sets in graphs and Latin squares
Electronic Notes in Discrete Mathematics
2007-05-29Paper
Maximum transversal in partial Latin squares and rainbow matchings
Discrete Applied Mathematics
2007-03-08Paper
Results on the Grundy chromatic number of graphs
Discrete Mathematics
2006-12-14Paper
Bounds for the b-chromatic number of some families of graphs
Discrete Mathematics
2006-05-16Paper
scientific article; zbMATH DE number 2147949 (Why is no real title available?)2005-03-21Paper
scientific article; zbMATH DE number 1751952 (Why is no real title available?)2002-11-19Paper
Greedy defining sets of graphs
The Australasian Journal of Combinatorics
2001-05-06Paper
Defining sets in vertex colorings of graphs and latin rectangles
Discrete Mathematics
1998-01-12Paper
More algorithmic results for problems of spread of influence in edge-weighted graphs with and without incentives
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Manouchehr Zaker