Notice: Unexpected clearActionName after getActionName already called in /var/www/html/w/includes/context/RequestContext.php on line 333
Stephen T. Hedetniemi - MaRDI portal

Stephen T. Hedetniemi

From MaRDI portal
(Redirected from Person:1219555)
Person:251500

Available identifiers

zbMath Open hedetniemi.stephen-tDBLP29/6752WikidataQ64692880 ScholiaQ64692880MaRDI QIDQ251500

List of research outcomes





PublicationDate of PublicationType
Distinct representatives in special set families in graphs2025-01-02Paper
Efficient domination in grid graphs2024-10-28Paper
https://portal.mardi4nfdi.de/entity/Q61215692024-02-27Paper
https://portal.mardi4nfdi.de/entity/Q61598742023-06-23Paper
Self-coalition graphs2023-05-23Paper
Remembering Frank Harary2022-03-09Paper
Vertex sequences in graphs2022-03-09Paper
Models of Domination in Graphs2021-12-15Paper
Alliances and Related Domination Parameters2021-12-14Paper
The Private Neighbor Concept2021-12-14Paper
Domination in Chessboards2021-12-14Paper
Domination in Digraphs2021-12-14Paper
Algorithms and Complexity of Signed, Minus, and Majority Domination2021-12-14Paper
Algorithms and Complexity of Power Domination in Graphs2021-12-14Paper
Self-Stabilizing Domination Algorithms2021-12-14Paper
Algorithms and Complexity of Alliances in Graphs2021-12-14Paper
The upper domatic number of a graph2021-10-05Paper
New resolvability parameters of graphs2021-09-01Paper
Introduction to coalitions in graphs2021-09-01Paper
https://portal.mardi4nfdi.de/entity/Q50003232021-07-12Paper
https://portal.mardi4nfdi.de/entity/Q51332132020-11-12Paper
The 2-dimension of a Tree2020-01-30Paper
$k$-Efficient partitions of graphs2019-11-08Paper
Different-Distance Sets in a Graph2019-11-08Paper
Bounds on cost effective domination numbers2019-10-15Paper
$P$-Matchings in Graphs: A Brief Survey with Some Open Problems2019-07-24Paper
Ulam Numbers of Graphs2019-06-12Paper
An Annotated Glossary of Graph Theory Parameters, with Conjectures2019-06-12Paper
Client-server and cost effective sets in graphs2019-01-25Paper
Rainbow disconnection in graphs2018-08-10Paper
https://portal.mardi4nfdi.de/entity/Q45662262018-06-14Paper
https://portal.mardi4nfdi.de/entity/Q45662312018-06-14Paper
Distribution centers in graphs2018-05-24Paper
Partial Domination in Graphs2018-04-23Paper
https://portal.mardi4nfdi.de/entity/Q46040942018-02-23Paper
https://portal.mardi4nfdi.de/entity/Q46041192018-02-23Paper
https://portal.mardi4nfdi.de/entity/Q45908862017-11-20Paper
Lower bounds on the Roman and independent Roman domination numbers2017-07-19Paper
https://portal.mardi4nfdi.de/entity/Q52674942017-06-13Paper
https://portal.mardi4nfdi.de/entity/Q52674992017-06-13Paper
Split Domination, Independence, and Irredundance in Graphs2017-04-04Paper
https://portal.mardi4nfdi.de/entity/Q29712292017-04-04Paper
Edge Cut Domination, Irredundance, and Independence in Graphs2017-04-04Paper
Roman and Total Domination2017-03-20Paper
Restricted optimal pebbling and domination in graphs2017-02-27Paper
https://portal.mardi4nfdi.de/entity/Q29609582017-02-17Paper
My Top 10 Graph Theory Conjectures and Open Problems2016-12-16Paper
On \(ve\)-degrees and \(ev\)-degrees in graphs2016-12-14Paper
Double Roman domination2016-11-02Paper
Very cost effective bipartitions in graphs2016-10-14Paper
https://portal.mardi4nfdi.de/entity/Q28118222016-06-10Paper
Neighborhood-restricted \([\leq 2\)-achromatic colorings]2016-06-01Paper
https://portal.mardi4nfdi.de/entity/Q28099302016-05-30Paper
Vertex-edge domination in graphs2016-05-18Paper
https://portal.mardi4nfdi.de/entity/Q27998272016-04-13Paper
Roman \(\{2 \}\)-domination2016-04-07Paper
A Roman domination chain2016-03-02Paper
Domination number and Laplacian eigenvalue distribution2015-12-23Paper
A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets2015-10-08Paper
https://portal.mardi4nfdi.de/entity/Q52519952015-05-21Paper
Bounds on weak Roman and 2-rainbow domination numbers2014-09-12Paper
https://portal.mardi4nfdi.de/entity/Q28782102014-08-28Paper
https://portal.mardi4nfdi.de/entity/Q28760342014-08-15Paper
Downhill domination in graphs2014-07-28Paper
https://portal.mardi4nfdi.de/entity/Q54198622014-06-11Paper
Analyzing graphs by degrees2014-04-25Paper
\([1,2\)-sets in graphs]2014-04-23Paper
SELF-STABILIZING ALGORITHMS FOR UNFRIENDLY PARTITIONS INTO TWO DISJOINT DOMINATING SETS2014-04-10Paper
Quorum colorings of graphs2014-04-07Paper
https://portal.mardi4nfdi.de/entity/Q54054482014-04-02Paper
https://portal.mardi4nfdi.de/entity/Q54054902014-04-02Paper
https://portal.mardi4nfdi.de/entity/Q28693482014-01-03Paper
https://portal.mardi4nfdi.de/entity/Q53270702013-08-01Paper
https://portal.mardi4nfdi.de/entity/Q52989052013-06-25Paper
https://portal.mardi4nfdi.de/entity/Q52989262013-06-25Paper
Secondary and internal distances of sets in graphs. II2013-01-03Paper
A self-stabilizing algorithm for optimally efficient sets in graphs2012-10-23Paper
https://portal.mardi4nfdi.de/entity/Q28953542012-07-02Paper
https://portal.mardi4nfdi.de/entity/Q31180822012-03-01Paper
A note on \(\gamma\)-graphs2011-12-01Paper
γ-graphs of graphs2011-09-20Paper
https://portal.mardi4nfdi.de/entity/Q30892192011-08-24Paper
Secondary and internal distances of sets in graphs2011-02-08Paper
https://portal.mardi4nfdi.de/entity/Q30702322011-02-02Paper
Matchability and \(k\)-maximal matchings2011-01-14Paper
https://portal.mardi4nfdi.de/entity/Q30590322010-12-08Paper
High Performance Computing - HiPC 20032009-08-11Paper
Distributed Computing - IWDC 20032009-08-06Paper
A linear‐time algorithm for broadcast domination in a tree2009-07-28Paper
A note on trees, tables, and algorithms2009-07-28Paper
An anonymous self-stabilizing algorithm for 1-maximal independent set in trees2009-07-21Paper
https://portal.mardi4nfdi.de/entity/Q36355682009-07-06Paper
https://portal.mardi4nfdi.de/entity/Q36355742009-07-06Paper
Powerful alliances in graphs2009-06-19Paper
Linear time self-stabilizing colorings2009-04-28Paper
https://portal.mardi4nfdi.de/entity/Q36215352009-04-21Paper
Secondary domination in graphs2009-04-14Paper
On the Wimer method for designing edge-based algorithms2009-04-14Paper
https://portal.mardi4nfdi.de/entity/Q36157992009-03-24Paper
Distance-k Information in Self-stabilizing Algorithms2009-03-12Paper
Distance-\(k\) knowledge in self-stabilizing algorithms2008-06-24Paper
On domination and reinforcement numbers in trees2008-02-11Paper
Security in graphs2007-09-18Paper
Unsolved algorithmic problems on trees2006-10-12Paper
https://portal.mardi4nfdi.de/entity/Q54883312006-09-14Paper
Domination equivalence in graphs2006-05-09Paper
Broadcasts in graphs2006-01-10Paper
An algorithm for partial Grundy number on trees2005-12-29Paper
https://portal.mardi4nfdi.de/entity/Q54614512005-07-26Paper
https://portal.mardi4nfdi.de/entity/Q54616902005-07-26Paper
https://portal.mardi4nfdi.de/entity/Q46819942005-06-09Paper
Generalized subgraph-restricted matchings in graphs2005-06-01Paper
https://portal.mardi4nfdi.de/entity/Q46779722005-05-23Paper
SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS2005-05-06Paper
Offensive alliances in graphs2005-04-15Paper
https://portal.mardi4nfdi.de/entity/Q46623472005-03-30Paper
https://portal.mardi4nfdi.de/entity/Q46623522005-03-30Paper
https://portal.mardi4nfdi.de/entity/Q48261102004-11-11Paper
https://portal.mardi4nfdi.de/entity/Q48187952004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q48208182004-10-01Paper
https://portal.mardi4nfdi.de/entity/Q44702372004-06-22Paper
https://portal.mardi4nfdi.de/entity/Q44572162004-03-21Paper
Roman domination in graphs.2004-03-14Paper
Iterated colorings of graphs.2004-03-14Paper
Global defensive alliances in graphs2004-02-05Paper
On the equality of the partial Grundy and upper ochromatic numbers of graphs2003-12-04Paper
https://portal.mardi4nfdi.de/entity/Q44059242003-09-30Paper
Defending the Roman Empire---a new strategy2003-06-09Paper
\(H\)-forming sets in graphs2003-04-28Paper
Domination in Graphs Applied to Electric Power Networks2003-01-05Paper
Total irredundance in graphs2002-12-02Paper
Domination Subdivision Numbers2002-11-05Paper
Maximal matching stabilizes in time \(O(m)\)2002-07-25Paper
On \(k\)-dependent domination2002-05-28Paper
https://portal.mardi4nfdi.de/entity/Q45294952002-05-22Paper
Domination and independence subdivision numbers of graphs2002-03-24Paper
https://portal.mardi4nfdi.de/entity/Q49498442001-10-03Paper
Extremal graphs for inequalities involving domination parameters2001-02-05Paper
The complexity of approximating MAPs for belief networks with bounded probabilities2000-12-12Paper
The even adjacency split problem for graphs2000-11-27Paper
Irredundant and perfect neighbourhood sets in trees2000-11-02Paper
Acyclic domination2000-09-14Paper
https://portal.mardi4nfdi.de/entity/Q49339322000-09-05Paper
Minus domination in graphs2000-01-09Paper
On perfect neighborhood sets in graphs2000-01-09Paper
Restrained domination in graphs1999-09-12Paper
https://portal.mardi4nfdi.de/entity/Q42117531998-10-07Paper
https://portal.mardi4nfdi.de/entity/Q42117551998-10-07Paper
\(k\)-path partitions in trees1998-06-11Paper
Using maximality and minimality conditions to construct inequality chains1998-05-06Paper
https://portal.mardi4nfdi.de/entity/Q43786271998-03-31Paper
Reducing the adjacency matrix of a tree1998-03-08Paper
https://portal.mardi4nfdi.de/entity/Q43786311998-03-05Paper
https://portal.mardi4nfdi.de/entity/Q43687281997-12-08Paper
On weakly connected domination in graphs1997-06-09Paper
https://portal.mardi4nfdi.de/entity/Q52840911997-02-04Paper
https://portal.mardi4nfdi.de/entity/Q48949981997-01-26Paper
https://portal.mardi4nfdi.de/entity/Q56880981997-01-23Paper
The algorithmic complexity of minus domination in graphs1996-10-06Paper
https://portal.mardi4nfdi.de/entity/Q48651311996-08-22Paper
https://portal.mardi4nfdi.de/entity/Q48711511996-07-28Paper
https://portal.mardi4nfdi.de/entity/Q48651381996-06-27Paper
https://portal.mardi4nfdi.de/entity/Q48710331996-05-21Paper
https://portal.mardi4nfdi.de/entity/Q48711691996-05-21Paper
https://portal.mardi4nfdi.de/entity/Q48738181996-04-22Paper
Periodic gossiping on trees1996-04-11Paper
Minus domination in regular graphs1996-03-26Paper
https://portal.mardi4nfdi.de/entity/Q46975791995-09-12Paper
Nearly perfect sets in graphs1995-04-17Paper
https://portal.mardi4nfdi.de/entity/Q42945961994-11-03Paper
The Private Neighbor Cube1994-08-29Paper
https://portal.mardi4nfdi.de/entity/Q40285371993-03-28Paper
https://portal.mardi4nfdi.de/entity/Q39775841992-06-25Paper
On the computational complexity of upper fractional domination1990-01-01Paper
Introduction to ``Topics on Domination1990-01-01Paper
Bibliography on domination in graphs and some basic definitions of domination parameters1990-01-01Paper
Centering a spanning tree of a biconnected graph1989-01-01Paper
The subchromatic number of a graph1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57539851988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34705051988-01-01Paper
A survey of gossiping and broadcasting in communication networks1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38153221988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38206281988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38266181988-01-01Paper
Gallai theorems for graphs, hypergraphs, and set systems1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30337831988-01-01Paper
On the equality of the grundy and ochromatic numbers of a graph1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37859781987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37971901987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37374611986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37605631986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37705711986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37774741986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38161181986-01-01Paper
On the diagonal queens domination problem1986-01-01Paper
A linear algorithm for finding a minimum dominating set in a cactus1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36935371985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37316391985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37316401985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37402311985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37617071985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37895851985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37911951985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33409001984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36884331984-01-01Paper
On the Algorithmic Complexity of Total Domination1984-01-01Paper
A note on total domination1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33374871984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33419201983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33382911983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47399461982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47452721982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47506571982-01-01Paper
Partitioning trees: Matching, domination, and maximum diameter1981-01-01Paper
Information Dissemination in Trees1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39486061981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39521311981-01-01Paper
Total domination in graphs1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38955001980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38970721980-01-01Paper
Rectilinear Steiner Trees in Rectangle Trees1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38645691979-01-01Paper
Matchings and transversals in hypergraphs, domination and independence in trees1979-01-01Paper
Linear algorithms for edge-coloring trees and unicyclic graphs1979-01-01Paper
Linear algorithms on recursive representations of trees1979-01-01Paper
Minimum broadcast graphs1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38644341978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42000751978-01-01Paper
Disjoint cliques in regular graphs of degree seven and eight1978-01-01Paper
A linear algorithm for disjoint matchings in trees1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38709171977-01-01Paper
A property of trees in terms of unique connected subgraphs1977-01-01Paper
Towards a theory of domination in graphs1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32069691977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40717721976-01-01Paper
On the optional hamiltonian completion problem1976-01-01Paper
b-Matchings in Trees1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41035451976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41282851976-01-01Paper
Disjoint independent dominating sets in graphs1976-01-01Paper
Advances on the Hamiltonian Completion Problem1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41233491975-01-01Paper
A linear algorithm for the domination number of a tree1975-01-01Paper
On Hamiltonian Walks in Graphs1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40506411974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40609851974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40796421974-01-01Paper
Sufficient conditions for a graph to be Hamiltonian1974-01-01Paper
Eulerian Walks in Graphs1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40749251973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40837121973-01-01Paper
Hereditary properties of raphs1973-01-01Paper
𝒮-Semigroups of Automata1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56685061972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56775021972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56213821971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40506331971-01-01Paper
Graphs with forbidden subgraphs1971-01-01Paper
The achromatic number of a graph1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56688241970-01-01Paper
Uniquely colorable graphs1969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55860691969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55860701969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55891161969-01-01Paper
On minimum walks in graphs1968-01-01Paper
On Partitioning Planar Graphs1968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55609161968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55788011967-01-01Paper

Research outcomes over time

This page was built for person: Stephen T. Hedetniemi