default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMustapha Chellali
- > Home > Persons > Mustapha Chellali
Publications
- 2018
[j65]Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi:
Client-server and cost effective sets in graphs. AKCE Int. J. Graphs Comb. 15(2): 211-218 (2018)- 2017
- [j61]Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Thomas M. Lewis:
Restricted optimal pebbling and domination in graphs. Discret. Appl. Math. 221: 46-53 (2017) - [j59]Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Thomas M. Lewis:
On ve-degrees and ev-degrees in graphs. Discret. Math. 340(2): 31-38 (2017) - 2016
- [j53]Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Alice A. McRae:
Roman {2}-domination. Discret. Appl. Math. 204: 22-28 (2016) - [j51]Mustapha Chellali, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae:
A Roman Domination Chain. Graphs Comb. 32(1): 79-92 (2016) - 2014
- [j44]Mustapha Chellali, Odile Favaron, Teresa W. Haynes, Stephen T. Hedetniemi, Alice A. McRae:
Independent [1, k]-sets in graphs. Australas. J Comb. 59: 144-156 (2014) - [j43]Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi:
Bounds on weak roman and 2-rainbow domination numbers. Discret. Appl. Math. 178: 27-32 (2014) - 2013
- [j36]Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Alice A. McRae:
[1, 2]-sets in graphs. Discret. Appl. Math. 161(18): 2885-2893 (2013) - 2010
- [j25]Mustapha Chellali, Teresa W. Haynes:
Double domination stable graphs upon edge removal. Australas. J Comb. 47: 157-164 (2010) - [j20]Mustapha Chellali, Teresa W. Haynes, Lutz Volkmann:
k-independence stable graphs upon edge removal. Discuss. Math. Graph Theory 30(2): 265-274 (2010) - 2009
- [j19]Mustapha Chellali, Teresa W. Haynes, Lutz Volkmann:
Global offensive alliance numbers in graphs with emphasis on trees. Australas. J Comb. 45: 87-96 (2009) - [j17]Mustapha Chellali, Teresa W. Haynes, Bert Randerath, Lutz Volkmann:
Bounds on the global offensive k-alliance number in graphs. Discuss. Math. Graph Theory 29(3): 597-613 (2009) - 2008
- [j15]Mustapha Chellali, Odile Favaron, Teresa W. Haynes, Dalila Raber:
Ratios of some domination parameters in trees. Discret. Math. 308(17): 3879-3887 (2008) - 2007
- [j10]Mustapha Chellali, Teresa W. Haynes:
Global Alliances and Independence in Trees. Discuss. Math. Graph Theory 27(1): 19-27 (2007) - 2006
- [j9]Mostafa Blidia, Mustapha Chellali, Teresa W. Haynes:
Characterizations of trees with equal paired and double domination numbers. Discret. Math. 306(16): 1840-1845 (2006) - 2004
- [j2]Mustapha Chellali, Teresa W. Haynes:
Trees with Unique Minimum Paired-Dominating Sets. Ars Comb. 73 (2004)
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 2024-09-22 00:38 CEST 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:
