| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6121569 | 2024-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6159874 | 2023-06-23 | Paper |
| Self-coalition graphs | 2023-05-23 | Paper |
| Remembering Frank Harary | 2022-03-09 | Paper |
| Vertex sequences in graphs | 2022-03-09 | Paper |
| Models of Domination in Graphs | 2021-12-15 | Paper |
| Alliances and Related Domination Parameters | 2021-12-14 | Paper |
| The Private Neighbor Concept | 2021-12-14 | Paper |
| Domination in Chessboards | 2021-12-14 | Paper |
| Domination in Digraphs | 2021-12-14 | Paper |
| Algorithms and Complexity of Signed, Minus, and Majority Domination | 2021-12-14 | Paper |
| Algorithms and Complexity of Power Domination in Graphs | 2021-12-14 | Paper |
| Self-Stabilizing Domination Algorithms | 2021-12-14 | Paper |
| Algorithms and Complexity of Alliances in Graphs | 2021-12-14 | Paper |
| The upper domatic number of a graph | 2021-10-05 | Paper |
| New resolvability parameters of graphs | 2021-09-01 | Paper |
| Introduction to coalitions in graphs | 2021-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5000323 | 2021-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5133213 | 2020-11-12 | Paper |
| The 2-dimension of a Tree | 2020-01-30 | Paper |
| $k$-Efficient partitions of graphs | 2019-11-08 | Paper |
| Different-Distance Sets in a Graph | 2019-11-08 | Paper |
| Bounds on cost effective domination numbers | 2019-10-15 | Paper |
| $P$-Matchings in Graphs: A Brief Survey with Some Open Problems | 2019-07-24 | Paper |
| Ulam Numbers of Graphs | 2019-06-12 | Paper |
| An Annotated Glossary of Graph Theory Parameters, with Conjectures | 2019-06-12 | Paper |
| Client-server and cost effective sets in graphs | 2019-01-25 | Paper |
| Rainbow disconnection in graphs | 2018-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4566226 | 2018-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4566231 | 2018-06-14 | Paper |
| Distribution centers in graphs | 2018-05-24 | Paper |
| Partial Domination in Graphs | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4604094 | 2018-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4604119 | 2018-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4590886 | 2017-11-20 | Paper |
| Lower bounds on the Roman and independent Roman domination numbers | 2017-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5267494 | 2017-06-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5267499 | 2017-06-13 | Paper |
| Split Domination, Independence, and Irredundance in Graphs | 2017-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2971229 | 2017-04-04 | Paper |
| Edge Cut Domination, Irredundance, and Independence in Graphs | 2017-04-04 | Paper |
| Roman and Total Domination | 2017-03-20 | Paper |
| Restricted optimal pebbling and domination in graphs | 2017-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2960958 | 2017-02-17 | Paper |
| My Top 10 Graph Theory Conjectures and Open Problems | 2016-12-16 | Paper |
| On \(ve\)-degrees and \(ev\)-degrees in graphs | 2016-12-14 | Paper |
| Double Roman domination | 2016-11-02 | Paper |
| Very cost effective bipartitions in graphs | 2016-10-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2811822 | 2016-06-10 | Paper |
| Neighborhood-restricted \([\leq 2\)-achromatic colorings] | 2016-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2809930 | 2016-05-30 | Paper |
| Vertex-edge domination in graphs | 2016-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2799827 | 2016-04-13 | Paper |
| Roman \(\{2 \}\)-domination | 2016-04-07 | Paper |
| A Roman domination chain | 2016-03-02 | Paper |
| Domination number and Laplacian eigenvalue distribution | 2015-12-23 | Paper |
| A theorem of Ore and self-stabilizing algorithms for disjoint minimal dominating sets | 2015-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5251995 | 2015-05-21 | Paper |
| Bounds on weak Roman and 2-rainbow domination numbers | 2014-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2878210 | 2014-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2876034 | 2014-08-15 | Paper |
| Downhill domination in graphs | 2014-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5419862 | 2014-06-11 | Paper |
| Analyzing graphs by degrees | 2014-04-25 | Paper |
| \([1,2\)-sets in graphs] | 2014-04-23 | Paper |
| SELF-STABILIZING ALGORITHMS FOR UNFRIENDLY PARTITIONS INTO TWO DISJOINT DOMINATING SETS | 2014-04-10 | Paper |
| Quorum colorings of graphs | 2014-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5405448 | 2014-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5405490 | 2014-04-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2869348 | 2014-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5327070 | 2013-08-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5298905 | 2013-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5298926 | 2013-06-25 | Paper |
| Secondary and internal distances of sets in graphs. II | 2013-01-03 | Paper |
| A self-stabilizing algorithm for optimally efficient sets in graphs | 2012-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2895354 | 2012-07-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3118082 | 2012-03-01 | Paper |
| A note on \(\gamma\)-graphs | 2011-12-01 | Paper |
| γ-graphs of graphs | 2011-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3089219 | 2011-08-24 | Paper |
| Secondary and internal distances of sets in graphs | 2011-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3070232 | 2011-02-02 | Paper |
| Matchability and \(k\)-maximal matchings | 2011-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3059032 | 2010-12-08 | Paper |
| High Performance Computing - HiPC 2003 | 2009-08-11 | Paper |
| Distributed Computing - IWDC 2003 | 2009-08-06 | Paper |
| A linear‐time algorithm for broadcast domination in a tree | 2009-07-28 | Paper |
| A note on trees, tables, and algorithms | 2009-07-28 | Paper |
| An anonymous self-stabilizing algorithm for 1-maximal independent set in trees | 2009-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3635568 | 2009-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3635574 | 2009-07-06 | Paper |
| Powerful alliances in graphs | 2009-06-19 | Paper |
| Linear time self-stabilizing colorings | 2009-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3621535 | 2009-04-21 | Paper |
| Secondary domination in graphs | 2009-04-14 | Paper |
| On the Wimer method for designing edge-based algorithms | 2009-04-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3615799 | 2009-03-24 | Paper |
| Distance-k Information in Self-stabilizing Algorithms | 2009-03-12 | Paper |
| Distance-\(k\) knowledge in self-stabilizing algorithms | 2008-06-24 | Paper |
| On domination and reinforcement numbers in trees | 2008-02-11 | Paper |
| Security in graphs | 2007-09-18 | Paper |
| Unsolved algorithmic problems on trees | 2006-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5488331 | 2006-09-14 | Paper |
| Domination equivalence in graphs | 2006-05-09 | Paper |
| Broadcasts in graphs | 2006-01-10 | Paper |
| An algorithm for partial Grundy number on trees | 2005-12-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5461451 | 2005-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5461690 | 2005-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4681994 | 2005-06-09 | Paper |
| Generalized subgraph-restricted matchings in graphs | 2005-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4677972 | 2005-05-23 | Paper |
| SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS | 2005-05-06 | Paper |
| Offensive alliances in graphs | 2005-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4662347 | 2005-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4662352 | 2005-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4826110 | 2004-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818795 | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4820818 | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470237 | 2004-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4457216 | 2004-03-21 | Paper |
| Roman domination in graphs. | 2004-03-14 | Paper |
| Iterated colorings of graphs. | 2004-03-14 | Paper |
| Global defensive alliances in graphs | 2004-02-05 | Paper |
| On the equality of the partial Grundy and upper ochromatic numbers of graphs | 2003-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4405924 | 2003-09-30 | Paper |
| Defending the Roman Empire---a new strategy | 2003-06-09 | Paper |
| \(H\)-forming sets in graphs | 2003-04-28 | Paper |
| Domination in Graphs Applied to Electric Power Networks | 2003-01-05 | Paper |
| Total irredundance in graphs | 2002-12-02 | Paper |
| Domination Subdivision Numbers | 2002-11-05 | Paper |
| Maximal matching stabilizes in time \(O(m)\) | 2002-07-25 | Paper |
| On \(k\)-dependent domination | 2002-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4529495 | 2002-05-22 | Paper |
| Domination and independence subdivision numbers of graphs | 2002-03-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4949844 | 2001-10-03 | Paper |
| Extremal graphs for inequalities involving domination parameters | 2001-02-05 | Paper |
| The complexity of approximating MAPs for belief networks with bounded probabilities | 2000-12-12 | Paper |
| The even adjacency split problem for graphs | 2000-11-27 | Paper |
| Irredundant and perfect neighbourhood sets in trees | 2000-11-02 | Paper |
| Acyclic domination | 2000-09-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4933932 | 2000-09-05 | Paper |
| Minus domination in graphs | 2000-01-09 | Paper |
| On perfect neighborhood sets in graphs | 2000-01-09 | Paper |
| Restrained domination in graphs | 1999-09-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4211753 | 1998-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4211755 | 1998-10-07 | Paper |
| \(k\)-path partitions in trees | 1998-06-11 | Paper |
| Using maximality and minimality conditions to construct inequality chains | 1998-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4378627 | 1998-03-31 | Paper |
| Reducing the adjacency matrix of a tree | 1998-03-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4378631 | 1998-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4368728 | 1997-12-08 | Paper |
| On weakly connected domination in graphs | 1997-06-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5284091 | 1997-02-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4894998 | 1997-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5688098 | 1997-01-23 | Paper |
| The algorithmic complexity of minus domination in graphs | 1996-10-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4865131 | 1996-08-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871151 | 1996-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4865138 | 1996-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871033 | 1996-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871169 | 1996-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4873818 | 1996-04-22 | Paper |
| Periodic gossiping on trees | 1996-04-11 | Paper |
| Minus domination in regular graphs | 1996-03-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4697579 | 1995-09-12 | Paper |
| Nearly perfect sets in graphs | 1995-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4294596 | 1994-11-03 | Paper |
| The Private Neighbor Cube | 1994-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028537 | 1993-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3977584 | 1992-06-25 | Paper |
| On the computational complexity of upper fractional domination | 1990-01-01 | Paper |
| Introduction to ``Topics on Domination | 1990-01-01 | Paper |
| Bibliography on domination in graphs and some basic definitions of domination parameters | 1990-01-01 | Paper |
| Centering a spanning tree of a biconnected graph | 1989-01-01 | Paper |
| The subchromatic number of a graph | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5753985 | 1988-01-01 | Paper |
| Gallai theorems for graphs, hypergraphs, and set systems | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3033783 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3470505 | 1988-01-01 | Paper |
| A survey of gossiping and broadcasting in communication networks | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3815322 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3820628 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3826618 | 1988-01-01 | Paper |
| On the equality of the grundy and ochromatic numbers of a graph | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785978 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3797190 | 1987-01-01 | Paper |
| On the diagonal queens domination problem | 1986-01-01 | Paper |
| A linear algorithm for finding a minimum dominating set in a cactus | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3737461 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3760563 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3770571 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3777474 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3816118 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3693537 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3731639 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3731640 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3740231 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3761707 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3789585 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3791195 | 1985-01-01 | Paper |
| A note on total domination | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3337487 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3340900 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3688433 | 1984-01-01 | Paper |
| On the Algorithmic Complexity of Total Domination | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3338291 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3341920 | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4739946 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4745272 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4750657 | 1982-01-01 | Paper |
| Partitioning trees: Matching, domination, and maximum diameter | 1981-01-01 | Paper |
| Information Dissemination in Trees | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3948606 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3952131 | 1981-01-01 | Paper |
| Total domination in graphs | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3895500 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3897072 | 1980-01-01 | Paper |
| Rectilinear Steiner Trees in Rectangle Trees | 1980-01-01 | Paper |
| Matchings and transversals in hypergraphs, domination and independence in trees | 1979-01-01 | Paper |
| Linear algorithms for edge-coloring trees and unicyclic graphs | 1979-01-01 | Paper |
| Linear algorithms on recursive representations of trees | 1979-01-01 | Paper |
| Minimum broadcast graphs | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3864569 | 1979-01-01 | Paper |
| Disjoint cliques in regular graphs of degree seven and eight | 1978-01-01 | Paper |
| A linear algorithm for disjoint matchings in trees | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3864434 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4200075 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3206969 | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3870917 | 1977-01-01 | Paper |
| A property of trees in terms of unique connected subgraphs | 1977-01-01 | Paper |
| Towards a theory of domination in graphs | 1977-01-01 | Paper |
| Disjoint independent dominating sets in graphs | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4071772 | 1976-01-01 | Paper |
| On the optional hamiltonian completion problem | 1976-01-01 | Paper |
| b-Matchings in Trees | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4103545 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4128285 | 1976-01-01 | Paper |
| A linear algorithm for the domination number of a tree | 1975-01-01 | Paper |
| Advances on the Hamiltonian Completion Problem | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4123349 | 1975-01-01 | Paper |
| On Hamiltonian Walks in Graphs | 1974-01-01 | Paper |
| Sufficient conditions for a graph to be Hamiltonian | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4050641 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4060985 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4079642 | 1974-01-01 | Paper |
| Eulerian Walks in Graphs | 1973-01-01 | Paper |
| Hereditary properties of raphs | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4074925 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4083712 | 1973-01-01 | Paper |
| 𝒮-Semigroups of Automata | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5668506 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5677502 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5621382 | 1971-01-01 | Paper |
| Graphs with forbidden subgraphs | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4050633 | 1971-01-01 | Paper |
| The achromatic number of a graph | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5668824 | 1970-01-01 | Paper |
| Uniquely colorable graphs | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5586069 | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5586070 | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5589116 | 1969-01-01 | Paper |
| On minimum walks in graphs | 1968-01-01 | Paper |
| On Partitioning Planar Graphs | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5560916 | 1968-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5578801 | 1967-01-01 | Paper |
