default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDManouchehr Zaker
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j32]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): 61 (2024)- [i13]Siavash Askari, Manouchehr Zaker:
More algorithmic results for problems of spread of influence in edge-weighted graphs with and without incentives. CoRR abs/2402.19257 (2024) - [i12]Manouchehr Zaker:
O(VE) time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with sufficiently large girth. CoRR abs/2406.00643 (2024) - [i11]Manouchehr Zaker:
On z-coloring and b*-coloring of graphs as improved variants of the b-coloring. CoRR abs/2408.12951 (2024) - 2023
- [j31]Abbas Khaleghi, Manouchehr Zaker:
More results on the z-chromatic number of graphs. Discret. Appl. Math. 338: 89-99 (2023) - [j30]Zoia Masih, Manouchehr Zaker:
A Comparison of the Grundy and b-Chromatic Number of K2,t -Free Graphs. Graphs Comb. 39(1): 16 (2023) - [i10]Abbas Khaleghi, Manouchehr Zaker:
More results on the z-chromatic number of graphs. CoRR abs/2302.01306 (2023) - 2022
- [j29]Zoya Masih, Manouchehr Zaker:
Some comparative results concerning the Grundy and b-chromatic number of graphs. Discret. Appl. Math. 306: 1-6 (2022) - 2021
- [j28]Zoya Masih, Manouchehr Zaker:
On Grundy and b-Chromatic Number of Some Families of Graphs: A Comparative Study. Graphs Comb. 37(2): 605-620 (2021) - [i9]Manouchehr Zaker:
More relations between $λ$-labeling and Hamiltonian paths with emphasis on line graph of bipartite multigraphs. CoRR abs/2111.13919 (2021) - 2020
- [j27]Manouchehr Zaker:
A New Vertex Coloring Heuristic and Corresponding Chromatic Number. Algorithmica 82(9): 2395-2414 (2020) - [j26]Manouchehr Zaker:
On irreversible spread of influence in edge-weighted graphs. Contributions Discret. Math. 15(2): 60-72 (2020) - [i8]Manouchehr Zaker:
A new vertex coloring heuristic and corresponding chromatic number. CoRR abs/2011.07295 (2020)
2010 – 2019
- 2019
- [i7]Manouchehr Zaker:
On irreversible spread of influence in edge-weighted graphs. CoRR abs/1912.01243 (2019) - 2018
- [i6]Hossein Soltani, Manouchehr Zaker:
Partial vertex covers and the complexity of some problems concerning static and dynamic monopolies. CoRR abs/1806.02770 (2018) - [i5]Mitra Nemati Andavari, Manouchehr Zaker:
Weak dynamic monopolies in social graphs. CoRR abs/1806.02783 (2018) - 2017
- [j25]Manouchehr Zaker:
First-Fit coloring of Cartesian product graphs and its defining sets. Contributions Discret. Math. 12(1) (2017) - [j24]Zixing Tang, Baoyindureng Wu, Lin Hu, Manouchehr Zaker:
More bounds for the Grundy number of graphs. J. Comb. Optim. 33(2): 580-589 (2017) - [j23]Manouchehr Zaker:
A note on orientation and chromatic number of graphs. J. Comb. Optim. 34(2): 605-611 (2017) - 2016
- [j22]Manouchehr Zaker:
Lower bounds for the independence and k-independence number of graphs using the concept of degenerate degrees. Discret. Appl. Math. 203: 204-216 (2016) - [j21]Manouchehr Zaker, Hossein Soltani
:
First-Fit colorings of graphs with no cycles of a prescribed even length. J. Comb. Optim. 32(3): 775-783 (2016) - 2014
- [j20]Manouchehr Zaker:
More results on greedy defining sets. Ars Comb. 114: 53-64 (2014) - [j19]Kaveh Khoshkhah, Hossein Soltani, Manouchehr Zaker:
Dynamic monopolies in directed graphs: The spread of unilateral influence in social networks. Discret. Appl. Math. 171: 81-89 (2014) - 2013
- [j18]Manouchehr Zaker:
Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs. Discret. Appl. Math. 161(16-17): 2716-2723 (2013) - [j17]Kaveh Khoshkhah, M. Nemati, Hossein Soltani, Manouchehr Zaker:
A Study of Monopolies in Graphs. Graphs Comb. 29(5): 1417-1427 (2013) - 2012
- [j16]Kaveh Khoshkhah, Hossein Soltani, Manouchehr Zaker:
On dynamic monopolies of graphs: The average and strict majority thresholds. Discret. Optim. 9(2): 77-83 (2012) - [j15]Manouchehr Zaker:
On dynamic monopolies of graphs with general thresholds. Discret. Math. 312(6): 1136-1143 (2012) - [i4]Kaveh Khoshkhah, Hossein Soltani, Manouchehr Zaker:
On dynamic monopolies of graphs: the average and strict majority thresholds. CoRR abs/1202.1146 (2012) - [i3]Manouchehr Zaker:
Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs. CoRR abs/1205.2856 (2012) - [i2]Kaveh Khoshkhah, Hossein Soltani, Manouchehr Zaker:
Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks. CoRR abs/1212.3682 (2012) - 2011
- [j14]András Gyárfás, Manouchehr Zaker:
On (δ, χ)-Bounded Families of Graphs. Electron. J. Comb. 18(1) (2011) - [j13]Manouchehr Zaker:
Bounds for chromatic number in terms of even-girth and booksize. Discret. Math. 311(2-3): 197-204 (2011) - [j12]Manouchehr Zaker:
On lower bounds for the chromatic number in terms of vertex degree. Discret. Math. 311(14): 1365-1370 (2011) - [i1]Manouchehr Zaker:
On dynamic monopolies of graphs with general thresholds. CoRR abs/1103.1112 (2011)
2000 – 2009
- 2008
- [j11]Manouchehr Zaker:
Greedy Defining Sets in Latin Squares. Ars Comb. 89 (2008) - [j10]Manouchehr Zaker:
New bounds for the chromatic number of graphs. J. Graph Theory 58(2): 110-122 (2008) - 2007
- [j9]Manouchehr Zaker:
Maximum transversal in partial Latin squares and rainbow matchings. Discret. Appl. Math. 155(4): 558-565 (2007) - [j8]Manouchehr Zaker:
Inequalities for the Grundy chromatic number of graphs. Discret. Appl. Math. 155(18): 2567-2572 (2007) - 2006
- [j7]Mekkia Kouider, Manouchehr Zaker:
Bounds for the b-chromatic number of some families of graphs. Discret. Math. 306(7): 617-623 (2006) - [j6]Manouchehr Zaker:
Results on the Grundy chromatic number of graphs. Discret. Math. 306(23): 3166-3173 (2006) - [j5]Manouchehr Zaker:
Greedy defining sets in graphs and Latin squares. Electron. Notes Discret. Math. 24: 299-302 (2006) - 2005
- [j4]Manouchehr Zaker:
Grundy chromatic number of the complement of bipartite graphs. Australas. J Comb. 31: 325-330 (2005) - 2001
- [j3]Manouchehr Zaker:
Greedy defining sets of graphs. Australas. J Comb. 23: 231-236 (2001)
1990 – 1999
- 1999
- [j2]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): 233-236 (1999) - 1997
- [j1]Ebadollah S. Mahmoodian, Reza Naserasr, Manouchehr Zaker:
Defining sets in vertex colorings of graphs and latin rectangles. Discret. Math. 167-168: 451-460 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
