Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStephen T. Hedetniemi
- > Home > Persons > Stephen T. Hedetniemi
Publications
- 2023
[j113]Teresa W. Haynes, Jason Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Raghuveer Mohan:
Coalition graphs of paths, cycles, and trees. Discuss. Math. Graph Theory 43(4): 931-946 (2023)- 2020
- [j112]Teresa W. Haynes, Jason T. Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Nicholas Phillips:
The upper domatic number of a graph. AKCE Int. J. Graphs Comb. 17(1): 139-148 (2020) - [j111]Teresa W. Haynes, Jason T. Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Raghuveer Mohan:
Introduction to coalitions in graphs. AKCE Int. J. Graphs Comb. 17(2): 653-659 (2020) - 2018
- [j109]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) - [j108]Wyatt J. Desormeaux, Teresa W. Haynes, Stephen T. Hedetniemi, Christian Moore:
Distribution centers in graphs. Discret. Appl. Math. 243: 186-193 (2018) - [j107]Gary Chartrand, Stephen Devereaux, Teresa W. Haynes, Stephen T. Hedetniemi, Ping Zhang:
Rainbow disconnection in graphs. Discuss. Math. Graph Theory 38(4): 1007-1021 (2018) - 2017
- [j106]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) - [j105]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
- [j104]Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Alice A. McRae:
Roman {2}-domination. Discret. Appl. Math. 204: 22-28 (2016) - [j103]James D. Chandler, Wyatt J. Desormeaux, Teresa W. Haynes, Stephen T. Hedetniemi:
Neighborhood-restricted [≤2]-achromatic colorings. Discret. Appl. Math. 207: 39-44 (2016) - [j102]Robert A. Beeler, Teresa W. Haynes, Stephen T. Hedetniemi:
Double Roman domination. Discret. Appl. Math. 211: 23-29 (2016) - [j100]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) - 2015
- [j99]Teresa W. Haynes, Stephen T. Hedetniemi, Inna Vasylieva:
Very cost effective bipartitions in graphs. AKCE Int. J. Graphs Comb. 12(Issues): 155-160 (2015) - 2014
- [j97]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) - [j96]Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi:
Bounds on weak roman and 2-rainbow domination numbers. Discret. Appl. Math. 178: 27-32 (2014) - [j95]Teresa W. Haynes, Stephen T. Hedetniemi, William B. Jamieson, Jessie D. Jamieson:
Downhill domination in graphs. Discuss. Math. Graph Theory 34(3): 603-612 (2014) - 2013
- [j93]Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Alice A. McRae:
[1, 2]-sets in graphs. Discret. Appl. Math. 161(18): 2885-2893 (2013) - 2009
- [j87]Robert C. Brigham, Ronald D. Dutton, Teresa W. Haynes, Stephen T. Hedetniemi:
Powerful alliances in graphs. Discret. Math. 309(8): 2140-2147 (2009) - 2006
- [j79]Jean E. Dunbar, David J. Erwin
, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi:
Broadcasts in graphs. Discret. Appl. Math. 154(1): 59-75 (2006) - 2003
- [j66]Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning:
Global Defensive Alliances in Graphs. Electron. J. Comb. 10 (2003) - [j65]Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Peter J. Slater:
H-forming sets in graphs. Discret. Math. 262(1-3): 159-169 (2003) - 2002
- [j60]Odile Favaron, Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Debra J. Knisley:
Total irredundance in graphs. Discret. Math. 256(1-2): 115-127 (2002) - [j59]Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning:
Domination in Graphs Applied to Electric Power Networks. SIAM J. Discret. Math. 15(4): 519-529 (2002) - 2001
- [j58]Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Debra J. Knisley:
Stable and unstable graphs with total irredundance number zero. Ars Comb. 61 (2001) - [j57]Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, David Pokrass Jacobs, James A. Knisely, Lucas C. van der Merwe:
Domination Subdivision Numbers. Discuss. Math. Graph Theory 21(2): 239-253 (2001) - 2000
- [j53]Baogen Xu, Ernest J. Cockayne, Teresa W. Haynes, Stephen T. Hedetniemi, Zhou Shangchao:
Extremal graphs for inequalities involving domination parameters. Discret. Math. 216(1-3): 1-10 (2000) - [j51]Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi:
Domination and independence subdivision numbers of graphs. Discuss. Math. Graph Theory 20(2): 271-280 (2000) - 1999
- [j49]Gerd Fricke, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning:
On perfect neighborhood sets in graphs. Discret. Math. 199(1-3): 221-225 (1999) - 1998
- [b1]Teresa W. Haynes, Stephen T. Hedetniemi, Peter J. Slater:
Fundamentals of domination in graphs. Pure and applied mathematics 208, Dekker 1998, ISBN 978-0-8247-0033-1, pp. I-XI, 1-446
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 2023-09-27 22:43 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:
