Wayne Goddard
Wayne Goddard
Geverifieerd e-mailadres voor clemson.edu
Geciteerd door
Geciteerd door
Research methodology: An introduction
W Goddard, S Melville
Juta and Company Ltd, 2004
Independent domination in graphs: A survey and recent results
W Goddard, MA Henning
Discrete Mathematics 313 (7), 839-854, 2013
Defective coloring revisited
L Cowen, W Goddard, CE Jesurum
Journal of Graph Theory 24 (3), 205-219, 1997
A survey of integrity
KS Bagga, LW Beineke, WD Goddard, MJ Lipman, RE Pippert
Discrete Applied Mathematics 37, 13-28, 1992
Vizing's conjecture: a survey and recent results
B Brešar, P Dorbec, W Goddard, BL Hartnell, MA Henning, S Klavžar, ...
Journal of Graph Theory 69 (1), 46-76, 2012
Eternal security in graphs
W Goddard, SM Hedetniemi, ST Hedetniemi
J. Combin. Math. Combin. Comput 52, 169-180, 2005
The average eccentricity of a graph and its subgraphs
P Dankelmann, W Goddard, CS Swart
Utilitas Mathematica 65, 41-52, 2004
Broadcast chromatic numbers of graphs
W Goddard, SM Hedetniemi, ST Hedetniemi, JM Harris, DF Rall
Ars Combinatoria 86, 33-50, 2008
Offensive alliances in graphs
O Favaron, G Fricke, W Goddard, S Hedetniemi, S Hedetniemi, ...
Discussiones Mathematicae Graph Theory 24 (2), 263-275, 2004
Research Methodology: An introduction for science and engineering students
S Melville, W Goddard
Kenwyn: Juta & Co Ltd, 1996
Distance in graphs
W Goddard, OR Oellermann
Structural Analysis of Complex Networks, 49-72, 2011
Distance-two information in self-stabilizing algorithms
M Gairing, W Goddard, ST Hedetniemi, P Kristiansen, AA McRae
Parallel Processing Letters 14 (03n04), 387-398, 2004
Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks
W Goddard, ST Hedetniemi, DP Jacobs, PK Srimani
Proceedings International Parallel and Distributed Processing Symposium, 14 pp., 2003
The diameter of total domination vertex critical graphs
W Goddard, TW Haynes, MA Henning, LC Van Der Merwe
Discrete mathematics 286 (3), 255-261, 2004
Crossing families
B Aronov, P Erdős, W Goddard, DJ Kleitman, M Klugerman, J Pach, ...
Proceedings of the seventh annual symposium on Computational geometry, 351-356, 1991
The agreement metric for labeled binary trees
W Goddard, E Kubicka, G Kubicki, FR McMorris
Mathematical Biosciences 123 (2), 215-226, 1994
Acyclic colorings of planar graphs
W Goddard
Discrete Mathematics 91 (1), 91-94, 1991
Weakly pancyclic graphs
S Brandt, R Faudree, W Goddard
Journal of Graph Theory 27 (3), 141-176, 1998
A synchronous self-stabilizing minimal domination protocol in an arbitrary network graph
Z Xu, ST Hedetniemi, W Goddard, PK Srimani
International Workshop on Distributed Computing, 26-32, 2003
Domination in planar graphs with small diameter
W Goddard, MA Henning
Journal of Graph Theory 40 (1), 1-25, 2002
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20