Wayne Goddard

According to our database1, Wayne Goddard authored at least 102 papers between 1990 and 2019.

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



In proceedings 
PhD thesis 


On csauthors.net:


Almost injective colorings.
Discussiones Mathematicae Graph Theory, 2019

Thoroughly dispersed colorings.
Journal of 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.
Discrete Applied Mathematics, 2018

Coloring Graphs to Produce Properly Colored Walks.
Graphs and Combinatorics, 2017

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

Vertex colorings without rainbow subgraphs.
Discussiones Mathematicae Graph Theory, 2016

WORM colorings.
Discussiones Mathematicae Graph Theory, 2015

A note on S-packing colorings of lattices.
Discrete Applied Mathematics, 2014

A characterisation of eccentric sequences of maximal outerplanar graphs.
Australasian J. Combinatorics, 2014

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.
Discrete Mathematics, 2013

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

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

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

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

The S-packing chromatic number of a graph.
Discussiones Mathematicae Graph Theory, 2012

Dense graphs with small clique number.
Journal of 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

Capacitated Domination.
Ars Comb., 2010

Self-stabilizing master-slave token circulation and efficient size-computation in a unidirectional ring of arbitrary size.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

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

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

The binding number of a graph and its cliques.
Discrete Applied Mathematics, 2009

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

Self-Stabilizing Graph Protocols.
Parallel Processing Letters, 2008

On domination and reinforcement numbers in trees.
Discrete Mathematics, 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

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

Orientation distance graphs revisited.
Discussiones Mathematicae Graph Theory, 2007

Construction of trees and graphs with equal domination parameters.
Discrete Mathematics, 2006

Simultaneous graph parameters: Factor domination and factor total domination.
Discrete Mathematics, 2006

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

Distance-k 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

Multiple vertex coverings by cliques.
Journal of 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.
IJDSN, 2005

An algorithm for partial Grundy number on trees.
Discrete Mathematics, 2005

Generalized subgraph-restricted matchings in graphs.
Discrete Mathematics, 2005

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

Distance-two information in self-stabilizing algorithms.
Parallel Processing Letters, 2004

Self-Stabilizing Maximal K-Dependent Sets In Linear Time.
Parallel Processing Letters, 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 and Combinatorics, 2004

Hereditary domination and independence parameters .
Discussiones Mathematicae Graph Theory, 2004

Offensive alliances in graphs.
Discussiones Mathematicae Graph Theory, 2004

The diameter of total domination vertex critical graphs.
Discrete Mathematics, 2004

Maximum sizes of graphs with given domination parameters.
Discrete Mathematics, 2004

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

Distance and connectivity measures in permutation graphs.
Discrete Mathematics, 2003

Nordhaus-Gaddum bounds for independent domination.
Discrete Mathematics, 2003

Changing upper irredundance by edge addition.
Discrete Mathematics, 2003

MAD trees and distance-hereditary graphs.
Discrete Applied Mathematics, 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

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

Vertex Coverings by Coloured Induced Graphs - Frames and Umbrellas.
Electronic Notes in Discrete Mathematics, 2002

4-connected maximal planar graphs are 4-ordered.
Discrete Mathematics, 2002

Augmenting trees so that every three vertices lie on a cycle.
Discrete Applied Mathematics, 2002

Average distance in colored graphs.
Journal of Graph Theory, 2001

Pancyclicity of the prism.
Discrete Mathematics, 2001

Multipartite Ramsey Numbers.
Ars Comb., 2001

Bipartite Ramsey numbers and Zarankiewicz numbers.
Discrete Mathematics, 2000

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

Homogeneous Embeddings of Cycles in Graphs.
Graphs and Combinatorics, 1999

Real and integer domination in graphs.
Discrete Mathematics, 1999

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

Weakly pancyclic graphs.
Journal of Graph Theory, 1998

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

Defective coloring revisited.
Journal of Graph Theory, 1997

Maximum and minimum toughness of graphs of small genus.
Discrete Mathematics, 1997

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

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

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

The toughness of cubic graphs.
Graphs and Combinatorics, 1996

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

Distances between graphs under edge operations.
Discrete Mathematics, 1996

The Algorithmic Complexity of Minus Domination in Graphs.
Discrete Applied Mathematics, 1996

Mistilings with dominoes.
Discrete Mathematics, 1995

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

Measures of vulnerability-the integrity family.
Networks, 1994

Steiner distance stable graphs.
Discrete Mathematics, 1994

An upper bound for the Ramsey numbers r(K3, G).
Discrete Mathematics, 1994

Random packings of graphs.
Discrete Mathematics, 1994

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

A note on maximal triangle-free graphs.
Journal of 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

Some nordhaus- gaddum-type results.
Journal of Graph Theory, 1992

A Survey of Integrity.
Discrete Applied Mathematics, 1992

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

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

Acyclic colorings of planar graphs.
Discrete Mathematics, 1991

Crossing Families.
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

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