Person:186199: Difference between revisions

From MaRDI portal
Person:186199
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Wayne Goddard to Wayne Goddard: Duplicate
 
(No difference)

Latest revision as of 19:52, 8 December 2023

Available identifiers

zbMath Open goddard.wayne-dDBLP00/2242WikidataQ102164336 ScholiaQ102164336MaRDI QIDQ186199

List of research outcomes





PublicationDate of PublicationType
Illuminating a graph.2024-12-04Paper
Cycle-compelling colorings of graphs2024-10-09Paper
The packing number of cubic graphs2024-09-11Paper
Disjoint isolating sets and graphs with maximum isolation number2024-08-09Paper
https://portal.mardi4nfdi.de/entity/Q61213082024-02-26Paper
The fully weighted toughness of a graph2024-01-02Paper
Graphs with unique minimum specified domination sets2023-11-07Paper
The Lower Bipartite Number of a Graph2023-06-05Paper
There are 2-tough 4-regular graphs with claws2023-01-27Paper
Independent domination in outerplanar graphs2022-12-08Paper
Bipartite Domination in Graphs2022-11-09Paper
Well-hued graphs2022-08-24Paper
Compelling colorings: a generalization of the dominator chromatic number2022-06-03Paper
The maximum average connectivity among all orientations of a graph2022-04-13Paper
Domination and dominator colorings in planar graphs with small diameter2022-03-28Paper
Acyclic total dominating sets in cubic graphs2022-02-10Paper
Fractional Dominating Parameters2021-12-15Paper
Fractional Domatic, Idomatic, and Total Domatic Numbers of a Graph2021-12-14Paper
Compelling Colorings: A generalization of the dominator chromatic number2021-05-08Paper
Graphs in which all maximal bipartite subgraphs have the same order2020-12-16Paper
The generalized matcher game2020-07-07Paper
Independent domination, colorings and the fractional idomatic number of a graph2020-06-04Paper
Binding Number, Cycles, and Cliques2019-06-12Paper
Almost injective colorings2018-12-05Paper
Thoroughly dispersed colorings2018-07-13Paper
https://portal.mardi4nfdi.de/entity/Q45662362018-06-14Paper
Properly colored trails, paths, and bridges2018-03-01Paper
The matcher game played in graphs2018-02-22Paper
A note on domination and total domination in prisms2018-02-21Paper
Coloring graphs to produce properly colored walks2017-12-12Paper
Vertex Colorings without Rainbow or Monochromatic Subgraphs2017-11-20Paper
Coloring subgraphs with restricted amounts of hues2017-10-05Paper
The disjunctive domination number of a graph2017-03-20Paper
Colorings with Fractional Defect2017-02-05Paper
Vertex colorings without rainbow subgraphs2016-11-11Paper
Fractional, Circular, and Defective Coloring of Series-Parallel Graphs2016-02-01Paper
https://portal.mardi4nfdi.de/entity/Q55018332015-08-14Paper
Worm colorings2015-08-04Paper
https://portal.mardi4nfdi.de/entity/Q52519912015-05-21Paper
https://portal.mardi4nfdi.de/entity/Q28782092014-08-28Paper
https://portal.mardi4nfdi.de/entity/Q28760212014-08-15Paper
An efficient algorithm for stopping on a sink in a directed graph2014-05-14Paper
A note on \(S\)-packing colorings of lattices2014-02-18Paper
The S-packing chromatic number of a graph2013-12-13Paper
A note on extremal values of the scattering number2013-11-29Paper
https://portal.mardi4nfdi.de/entity/Q52989032013-06-25Paper
Daemon Conversions in Distributed Self-stabilizing Algorithms2013-04-12Paper
Eccentric counts, connectivity and chordality2013-03-21Paper
Independent domination in graphs: A survey and recent results2013-03-15Paper
SELF-STABILIZING MASTER–SLAVE TOKEN CIRCULATION AND EFFICIENT SIZE-COMPUTATION IN A UNIDIRECTIONAL RING OF ARBITRARY SIZE2013-01-18Paper
On the independent domination number of regular graphs2013-01-09Paper
Independent dominating sets in triangle-free graphs2012-07-10Paper
https://portal.mardi4nfdi.de/entity/Q28953542012-07-02Paper
https://portal.mardi4nfdi.de/entity/Q31180822012-03-01Paper
Vizing's conjecture: a survey and recent results2012-02-08Paper
The graph distance game2011-12-01Paper
Dense graphs with small clique number2011-04-19Paper
Bounds on the \(k\)-domination number of a graph2011-04-05Paper
https://portal.mardi4nfdi.de/entity/Q30702322011-02-02Paper
Distance in Graphs2010-12-21Paper
A characterization of cubic graphs with paired-domination number three-fifths their order2010-05-05Paper
The binding number of a graph and its cliques2010-04-28Paper
https://portal.mardi4nfdi.de/entity/Q33922852009-08-13Paper
High Performance Computing - HiPC 20032009-08-11Paper
Distributed Computing - IWDC 20032009-08-06Paper
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/Q36355742009-07-06Paper
Minimal claw-free graphs2009-05-06Paper
On the Wimer method for designing edge-based algorithms2009-04-14Paper
Distance-k Information in Self-stabilizing Algorithms2009-03-12Paper
https://portal.mardi4nfdi.de/entity/Q35139612008-07-21Paper
https://portal.mardi4nfdi.de/entity/Q35144962008-07-21Paper
Distance-\(k\) knowledge in self-stabilizing algorithms2008-06-24Paper
Orientation distance graphs revisited2008-02-22Paper
https://portal.mardi4nfdi.de/entity/Q54432172008-02-20Paper
On domination and reinforcement numbers in trees2008-02-11Paper
Restricted domination parameters in graphs2008-01-22Paper
https://portal.mardi4nfdi.de/entity/Q34294952007-04-02Paper
https://portal.mardi4nfdi.de/entity/Q30247342007-03-05Paper
Construction of trees and graphs with equal domination parameters2006-10-30Paper
Simultaneous graph parameters: factor domination and factor total domination2006-10-19Paper
https://portal.mardi4nfdi.de/entity/Q54926172006-10-16Paper
https://portal.mardi4nfdi.de/entity/Q54883272006-09-14Paper
https://portal.mardi4nfdi.de/entity/Q54883472006-09-14Paper
Domination equivalence in graphs2006-05-09Paper
An algorithm for partial Grundy number on trees2005-12-29Paper
https://portal.mardi4nfdi.de/entity/Q57085832005-11-18Paper
Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets2005-10-26Paper
https://portal.mardi4nfdi.de/entity/Q27159982005-07-20Paper
Vertex coverings by coloured induced graphs — Frames and Umbrellas2005-07-01Paper
https://portal.mardi4nfdi.de/entity/Q46819942005-06-09Paper
Generalized subgraph-restricted matchings in graphs2005-06-01Paper
SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS2005-05-06Paper
Multiple vertex coverings by cliques2005-04-21Paper
Hereditary domination and independence parameters2005-04-15Paper
Offensive alliances in graphs2005-04-15Paper
https://portal.mardi4nfdi.de/entity/Q46603332005-03-21Paper
Minimum degree conditions for cycles including specified sets of vertices2005-01-20Paper
The diameter of total domination vertex critical graphs2004-11-22Paper
https://portal.mardi4nfdi.de/entity/Q48261352004-11-11Paper
https://portal.mardi4nfdi.de/entity/Q48261692004-11-11Paper
https://portal.mardi4nfdi.de/entity/Q48219372004-10-22Paper
Maximum sizes of graphs with given domination parameters2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44575582004-03-25Paper
MAD trees and distance-hereditary graphs2003-09-25Paper
Distance and connectivity measures in permutation graphs2003-09-25Paper
Nordhaus--Gaddum bounds for independent domination2003-07-29Paper
https://portal.mardi4nfdi.de/entity/Q44058062003-06-23Paper
Changing upper irredundance by edge addition2003-06-09Paper
4-connected maximal planar graphs are 4-ordered2002-12-02Paper
https://portal.mardi4nfdi.de/entity/Q45521542002-08-29Paper
Average distance in colored graphs2002-08-28Paper
https://portal.mardi4nfdi.de/entity/Q45327482002-08-08Paper
Augmenting trees so that every three vertices lie on a cycle2002-08-08Paper
Domination in planar graphs with small diameter*2002-07-01Paper
https://portal.mardi4nfdi.de/entity/Q27681202002-01-30Paper
https://portal.mardi4nfdi.de/entity/Q27213272001-12-10Paper
Pancyclicity of the prism2001-07-02Paper
https://portal.mardi4nfdi.de/entity/Q44874612001-02-13Paper
Distances between graphs under edge operations2000-11-12Paper
Generalized eccentricity, radius, and diameter in graphs2000-10-23Paper
Bipartite Ramsey numbers and Zarankiewicz numbers2000-06-21Paper
https://portal.mardi4nfdi.de/entity/Q49400432000-03-01Paper
Real and integer domination in graphs2000-01-09Paper
Homogeneous embeddings of cycles in graphs1999-11-22Paper
https://portal.mardi4nfdi.de/entity/Q48745851999-09-29Paper
Weakly pancyclic graphs1999-05-26Paper
https://portal.mardi4nfdi.de/entity/Q43933451998-11-17Paper
Defective coloring revisited1997-11-16Paper
A note on cliques and independent sets1997-06-29Paper
Maximum and minimum toughness of graphs of small genus1997-06-09Paper
The algorithmic complexity of minus domination in graphs1996-10-06Paper
The toughness of cubic graphs1996-09-29Paper
https://portal.mardi4nfdi.de/entity/Q48923281996-09-15Paper
Counting pairs of lattice paths by intersections1996-07-09Paper
Forcing disjoint segments in the plane1996-07-02Paper
https://portal.mardi4nfdi.de/entity/Q48738291996-04-22Paper
https://portal.mardi4nfdi.de/entity/Q48738311996-04-22Paper
Measures of vulnerability–the integrity family1995-11-09Paper
https://portal.mardi4nfdi.de/entity/Q43269201995-06-11Paper
Steiner distance stable graphs1995-03-20Paper
Mistilings with dominoes1995-02-06Paper
https://portal.mardi4nfdi.de/entity/Q43091451995-01-09Paper
The agreement metric for labeled binary trees1994-12-19Paper
https://portal.mardi4nfdi.de/entity/Q43045671994-10-13Paper
Random packings of graphs1994-09-11Paper
An upper bound for the Ramsey numbers \(r(K_ 3,G)\)1994-09-11Paper
Crossing families1994-08-11Paper
WHICH TREES ARE UNIQUELY FRAMED BY THE HEAWOOD GRAPH?1994-04-21Paper
SOME GENERAL ASPECTS OF THE FRAMING NUMBER OF A GRAPH1994-04-21Paper
A note on maximal triangle‐free graphs1994-03-17Paper
Even Cycles in Directed Graphs1994-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40329891993-05-18Paper
Optimal Randomized Algorithms for Local Sorting and Set-Maxima1993-05-17Paper
Principal common divisors of graphs1993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q40284771993-03-28Paper
A survey of integrity1993-01-16Paper
Some nordhaus‐‐ gaddum‐type results1992-09-27Paper
An algorithm for outerplanar graphs with parameter1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39832561992-06-27Paper
Acyclic colorings of planar graphs1992-06-26Paper
On multipartite tournaments1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39805651992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q47130911992-06-25Paper
On distances between isomorphism classes of graphs1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q32030491990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34900191990-01-01Paper
On the Toughness of a Graph1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34721391988-01-01Paper
A CHARACTERIZATION OF STABLE GRAPHS ON A MAXIMUM(MINIMUM) NUMBER OF EDGES1986-01-01Paper
ALL GRAPHS ON A NON-PRIME NUMBER OF VERTICES ARE DESTRUCTIBLE1986-01-01Paper
Disjoint Isolating Sets and Graphs with Maximum Isolation NumberN/APaper

Research outcomes over time

This page was built for person: Wayne Goddard