Wayne Goddard

According to our database1, Wayne Goddard authored at least 114 papers between 1990 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The fully weighted toughness of a graph.
Discret. Appl. Math., January, 2024

2023
Graphs with Unique Minimum Specified Domination Sets.
Graphs Comb., October, 2023

Independent domination in outerplanar graphs.
Discret. Appl. Math., 2023

2022
The maximum average connectivity among all orientations of a graph.
J. Comb. Optim., 2022

Well-hued graphs.
Discret. Appl. Math., 2022

Domination and dominator colorings in planar graphs with small diameter.
Discret. Appl. Math., 2022

Compelling colorings: A generalization of the dominator chromatic number.
Appl. Math. Comput., 2022

2020
The generalized matcher game.
Discret. Appl. Math., 2020

Independent domination, colorings and the fractional idomatic number of a graph.
Appl. Math. Comput., 2020

2019
Almost injective colorings.
Discuss. Math. Graph Theory, 2019

2018
Thoroughly dispersed colorings.
J. Graph Theory, 2018

Properly colored trails, paths, and bridges.
J. Comb. Optim., 2018

A note on domination and total domination in prisms.
J. Comb. Optim., 2018

The matcher game played in graphs.
Discret. Appl. Math., 2018

2017
Coloring Graphs to Produce Properly Colored Walks.
Graphs Comb., 2017

2016
Fractional, Circular, and Defective Coloring of Series-Parallel Graphs.
J. Graph Theory, 2016

Vertex colorings without rainbow subgraphs.
Discuss. Math. Graph Theory, 2016

2015
WORM colorings.
Discuss. Math. Graph Theory, 2015

2014
A note on S-packing colorings of lattices.
Discret. Appl. Math., 2014

A characterisation of eccentric sequences of maximal outerplanar graphs.
Australas. J Comb., 2014

2013
An efficient algorithm for stopping on a sink in a directed graph.
Oper. Res. Lett., 2013

Independent domination in graphs: A survey and recent results.
Discret. Math., 2013

Daemon Conversions in Distributed Self-stabilizing Algorithms.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

2012
Vizing's conjecture: a survey and recent results.
J. Graph Theory, 2012

Independent dominating sets in triangle-free graphs.
J. Comb. Optim., 2012

Eccentric counts, connectivity and chordality.
Inf. Process. Lett., 2012

Self-Stabilizing Master-Slave Token Circulation and Efficient Size-Computation in a Unidirectional Ring of Arbitrary Size.
Int. J. Found. Comput. Sci., 2012

The <i>S</i>-packing chromatic number of a graph.
Discuss. Math. Graph Theory, 2012

2011
Dense graphs with small clique number.
J. Graph Theory, 2011

Bounds on the k-domination number of a graph.
Appl. Math. Lett., 2011

Self-Stabilizing Master-Slave Token Circulation and Efficient Topology Computation in a Tree of Arbitrary Size.
Proceedings of the 25th IEEE International Symposium on Parallel and Distributed Processing, 2011

Distance in Graphs.
Proceedings of the Structural Analysis of Complex Networks, 2011

2010
Capacitated Domination.
Ars Comb., 2010

2009
A note on trees, tables, and algorithms.
Networks, 2009

A Characterization of Cubic Graphs with Paired-Domination Number Three-Fifths Their Order.
Graphs Comb., 2009

The binding number of a graph and its cliques.
Discret. Appl. Math., 2009

2008
Distance- k knowledge in self-stabilizing algorithms.
Theor. Comput. Sci., 2008

Self-Stabilizing Graph Protocols.
Parallel Process. Lett., 2008

On domination and reinforcement numbers in trees.
Discret. Math., 2008

Braodcast Chromatic Numbers of Graphs.
Ars Comb., 2008

Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space.
Proceedings of the Distributed Computing and Networking, 9th International Conference, 2008

2007
Restricted domination parameters in graphs.
J. Comb. Optim., 2007

Orientation distance graphs revisited.
Discuss. Math. Graph Theory, 2007

2006
Construction of trees and graphs with equal domination parameters.
Discret. Math., 2006

Simultaneous graph parameters: Factor domination and factor total domination.
Discret. Math., 2006

Domination in Planar Graphs with Small Diameter II.
Ars Comb., 2006

Distance-<i>k</i> Information in Self-stabilizing Algorithms.
Proceedings of the Structural Information and Communication Complexity, 2006

An Anonymous Self-Stabilizing Algorithm for 1-Maximal Matching in Trees.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications & Conference on Real-Time Computing Systems and Applications, 2006

2005
Multiple vertex coverings by cliques.
J. Graph Theory, 2005

Self-Stabilizing Algorithms For Orderings And Colorings.
Int. J. Found. Comput. Sci., 2005

Self-Stabilizing Global Optimization Algorithms for Large Network Graphs.
Int. J. Distributed Sens. Networks, 2005

An algorithm for partial Grundy number on trees.
Discret. Math., 2005

Generalized subgraph-restricted matchings in graphs.
Discret. Math., 2005

Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets.
Discret. Math., 2005

2004
Distance-two information in self-stabilizing algorithms.
Parallel Process. Lett., 2004

Self-Stabilizing Maximal K-Dependent Sets In Linear Time.
Parallel Process. Lett., 2004

An anonymous self-stabilizing algorithm for 1-maximal independent set in trees.
Inf. Process. Lett., 2004

Minimum Degree Conditions for Cycles Including Specified Sets of Vertices.
Graphs Comb., 2004

Hereditary domination and independence parameters .
Discuss. Math. Graph Theory, 2004

Offensive alliances in graphs.
Discuss. Math. Graph Theory, 2004

The diameter of total domination vertex critical graphs.
Discret. Math., 2004

Maximum sizes of graphs with given domination parameters.
Discret. Math., 2004

Fault Tolerant Algorithms for Orderings and Colorings.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

2003
A computer / human mastermind player using grids.
South Afr. Comput. J., 2003

Distance and connectivity measures in permutation graphs.
Discret. Math., 2003

Nordhaus-Gaddum bounds for independent domination.
Discret. Math., 2003

Changing upper irredundance by edge addition.
Discret. Math., 2003

MAD trees and distance-hereditary graphs.
Discret. Appl. Math., 2003

A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph.
Proceedings of the Distributed Computing, 2003

A Self-Stabilizing Distributed Algorithm for Minimal Total Domination in an Arbitrary System Grap.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time.
Proceedings of the 23rd International Conference on Distributed Computing Systems Workshops (ICDCS 2003 Workshops), 2003

Self-Stabilizing Distributed Algorithm for Strong Matching in a System Graph.
Proceedings of the High Performance Computing - HiPC 2003, 10th International Conference, 2003

2002
Limited flooding protocol for mobile ad hoc networks.
South Afr. Comput. J., 2002

Domination in planar graphs with small diameter.
J. Graph Theory, 2002

Vertex Coverings by Coloured Induced Graphs - Frames and Umbrellas.
Electron. Notes Discret. Math., 2002

4-connected maximal planar graphs are 4-ordered.
Discret. Math., 2002

Augmenting trees so that every three vertices lie on a cycle.
Discret. Appl. Math., 2002

2001
Average distance in colored graphs.
J. Graph Theory, 2001

Pancyclicity of the prism.
Discret. Math., 2001

Multipartite Ramsey Numbers.
Ars Comb., 2001

2000
Bipartite Ramsey numbers and Zarankiewicz numbers.
Discret. Math., 2000

1999
Generalized eccentricity, radius, and diameter in graphs.
Networks, 1999

Homogeneous Embeddings of Cycles in Graphs.
Graphs Comb., 1999

Real and integer domination in graphs.
Discret. Math., 1999

Bounds on the Total Redundance and Efficiency of a Graph.
Ars Comb., 1999

1998
Weakly pancyclic graphs.
J. Graph Theory, 1998

1997
A note on cliques and independent sets.
J. Graph Theory, 1997

Defective coloring revisited.
J. Graph Theory, 1997

Maximum and minimum toughness of graphs of small genus.
Discret. Math., 1997

Graphs with Maximum Edge-Integrity.
Ars Comb., 1997

Coloring with Defect.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996
Counting Pairs of Lattice Paths by Intersections.
J. Comb. Theory, Ser. A, 1996

The toughness of cubic graphs.
Graphs Comb., 1996

Forcing Disjoint Segments in the Plane.
Eur. J. Comb., 1996

Distances between graphs under edge operations.
Discret. Math., 1996

The Algorithmic Complexity of Minus Domination in Graphs.
Discret. Appl. Math., 1996

1995
Mistilings with dominoes.
Discret. Math., 1995

1994
Even Cycles in Directed Graphs.
SIAM J. Discret. Math., 1994

Measures of vulnerability-the integrity family.
Networks, 1994

Steiner distance stable graphs.
Discret. Math., 1994

An upper bound for the Ramsey numbers r(K<sub>3</sub>, G).
Discret. Math., 1994

Random packings of graphs.
Discret. Math., 1994

Crossing Families.
Comb., 1994

1993
Optimal Randomized Algorithms for Local Sorting and Set-Maxima.
SIAM J. Comput., 1993

A note on maximal triangle-free graphs.
J. Graph Theory, 1993

Principal Common Divisors of Graphs.
Eur. J. Comb., 1993

Agreement Subtrees, Metric and Consensus for Labeled Binary Trees.
Proceedings of the Partitioning Data Sets, Proceedings of a DIMACS Workshop, 1993

1992
Some nordhaus- gaddum-type results.
J. Graph Theory, 1992

A Survey of Integrity.
Discret. Appl. Math., 1992

1991
On multipartite tournaments.
J. Comb. Theory, Ser. B, 1991

An Algorithm for Outerplanar Graphs with Parameter.
J. Algorithms, 1991

Acyclic colorings of planar graphs.
Discret. Math., 1991

1990
Optimal Randomized Algorithms for Local Sorting and Set-Maxima
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990


  Loading...