• All graphs on a non-prime number of vertices are destructible, wdg and P.A. Winter. Quaestiones Math., 8:381-385, 1986.
• A characterization of stable graphs on a maximum (minimum) number of edges, wdg and P.A. Winter. Quaestiones Math., 10:175-178, 1986.
• The integrity of combinations of graphs, wdg and H.C. Swart. J. Combin. Math. Combin. Comput., 4:3-18, 1988.
• On the toughness of a graph, wdg and H.C. Swart. Quaestiones Math., 13:217-232, 1990.
• The integrity of a graph: bounds and basics, wdg and H.C. Swart. J. Combin. Math. Combin. Comput., 7:139-151, 1990.
• Which graphs are distance graphs?, G. Chartrand, wdg, M. Henning, L. Lesniak, H.C. Swart, and C. Wall. Ars Combin., 29A:225-232, 1990.
• A new approach to distance stable graphs, wdg, O. Oellermann, and H.C. Swart. J. Combin. Math. Combin. Comput., 8:209-220, 1990.
• The binding number of trees and $K(1,3)$-free graphs, wdg. J. Combin. Math. Combin. Comput., 7:193-200, 1990.
• The integrity of the cube is small, L. Beineke, wdg, P. Hamburger, D.J. Kleitman, M. Lipman, and R. Pippert. J. Combin. Math. Combin. Comput, 9:191-193, 1991.
• On distances between isomorphism classes of graphs, G. Benadé, wdg, T.A. McKee, and P.A. Winter. Math. Bohem., 116:160-169, 1991.
• On multipartite tournaments, wdg, G. Kubicki, O. Oellermann, and S. Tian. J. Combin. Theory Ser. B, 52:284-300, 1991.
• Acyclic colorings of planar graphs, wdg. Discrete Math., 91:91-94, 1991.
• An algorithm for outerplanar graphs with parameter, Zhu Binghuan and wdg. J. Algorithms, 12:657-662, 1991.
• On some extremal problems in connectivity, wdg and H.C. Swart. In Graph Theory, Combinatorics, and Applications, Vol. 1, Y. Alavi et al. eds, pages 535-551, 1991.
• The cycle structure of multipartite tournaments, wdg and O. Oellermann. In Graph Theory, Combinatorics and Applications, Vol. 1, Y. Alavi et al. eds, pages 525-533, 1991.
• Two results on the binding numbers of products graphs, wdg and H.C. Swart. Ars Combin., 34:119-128, 1992.
• A survey of integrity, K.S. Bagga, L.W. Beineke, wdg, M.J. Lipman, and R.E. Pippert. Discrete Appl. Math., 37/38:13-28, 1992.
• Some Nordhaus-Gaddum-type results, wdg, M.A. Henning, and H.C. Swart. J. Graph Theory, 16:221-231, 1992.
• Principal common divisors, G. Chartrand, wdg, M.A. Henning, F. Saba, and H.C. Swart. Europ. J. Combin., 14:85-93, 1993.
• Path chromatic sequences of graphs, H. Chen, wdg, J. McCanna, and R. Poh. Bull. Inst. Combin. Appl., 7:33-35, 1993.
• The minimum size of agreement subtrees of two binary trees, wdg and G. Kubicki. Congr. Numer., 97:131-136, 1993.
• A note on maximal triangle-free graphs, wdg and D.J. Kleitman. J. Graph Theory, 17:629-631, 1993.
• Some general results on the framing number of a graph, wdg, M.A. Henning, O. Oellermann, and H.C. Swart. Quaestiones Math., 16:289-301, 1993.
• The agreement metric for labeled binary trees, wdg, E. Kubicka, G. Kubicki, and F. McMorris. Math. Biosci., 123:215-226, 1994.
• Randomly-packable graphs, L. Beineke, wdg, and P. Hamburger. Discrete Math., 125:45-54, 1994.
• An upper bound on the Ramsey numbers $r(K_3,G)$, wdg and D.J. Kleitman. Discrete Math., 125:177-182, 1994.
• Measures of vulnerability-The integrity family, wdg. Networks, 24:207-213, 1994.
• Steiner distance stable graphs, wdg, O. Oellermann, and H.C. Swart. Discrete Math., 132:65-73, 1994.
• Even cycles in directed graphs, F.R.K. Chung, wdg, and D.J. Kleitman. SIAM J. Discrete Math., 7:474-483, 1994.
• Agreement subtrees, metrics and consensus for labeled binary trees, wdg, E. Kubicka, G. Kubicki, and F. McMorris. In Partitioning Data Sets, Cox et al. eds, pages 97-104, 1995.
• The toughness of cubic graphs, wdg. Graphs Combin., 12:17-22, 1996.
• The edge integrity of cartesian products, L.W. Beineke, wdg, and M.J. Lipman. J. Combin. Math. Combin. Comput., 21:129-145, 1996.
• Distances between graphs via edge operations, wdg and H.C. Swart. Discrete Math., 161:121-132, 1996.
• The greatest common divisor index of a graph, G. Chartrand, wdg, G. Kubicki, C. Mynhardt, and F. Saba. J. Combin. Math. Combin. Comput., 20:11-26, 1996.
• On algorithmic complexity of minus domination, J. Dunbar, wdg, M.A. Henning, S. Hedetniemi, and A. McRae. Discrete Applied Math., 68:73-84, 1996.
• Extremal graphs with cliques and independent sets, R. Entringer, wdg, and M.A. Henning. J. Graph Theory, 24:21-23, 1997.
• Defective colorings revisited, L. Cowen, wdg, and E. Jesurum. J. Graph Theory, 24:205-219, 1997. Preliminary version in SODA 97.
• The toughness of graphs of small genus, wdg, M. Plummer, and H.C. Swart. Discrete Math., 167/168:329-339, 1997.
• Graphs with maximum edge integrity, L.W. Beineke, wdg, and M.J. Lipman. Ars Combin., 46:119-127, 1997.
• Generalized domination and independence, wdg and M.A. Henning. Congr. Numer., 123:161-171, 1997.
• Weakly pancyclic graphs, S. Brandt, R. Faudree, and wdg. J. Graph Theory, 27:141-176, 1998.
• Homogeneous embeddings of cycles in graphs, wdg, M. Henning, and H. Maharaj. Graphs Combin., 15:159-173, 1999.
• Real and integer domination in graphs, wdg and M. Henning. Discrete Math., 199:61-75, 1999.
• Generalised eccentricity, radius and diameter in graphs, P. Dankelmann, wdg, M.A. Henning, and H.C. Swart. Networks, 34:312-319, 1999.
• Bounds on the total redundance and efficiency of a graph, wdg, O. Oellermann, P. Slater, and H.C. Swart. Ars Combin., 54:129-138, 2000.
• Results about graph decomposition, greatest common divisor index for graphs and digraphs, wdg and G. Kubicki. J. Combin. Math. Combin. Comput., 32:173-184, 2000.
• Bipartite Ramsey numbers and Zarenkiewicz bounds, wdg, M.A. Henning, and O. Oellermann. Discrete Math., 219:85-95, 2000.
• Multipartite Ramsey numbers, D. Day, wdg, M.A. Henning, and H.C. Swart. Ars Combin., 58:23-31, 2001.
• Minimal and maximal $e=1$ functions, P. Dankelmann, D. Erwin, G. Fricke, wdg, and H.C. Swart. J. Combin. Math. Combin. Comput., 36:127-138, 2001.
• Pancyclicity of the prism, wdg and M.A. Henning. Discrete Math., 234:139-142, 2001.
• Average distance in coloured graphs, P. Dankelmann, wdg, and P. Slater. J. Graph Theory, 38:1-17, 2001.
• Between packable and randomly packable graphs: Packer-spoiler graphs, wdg and G. Kubicki. J. Combin. Math. Combin. Comput., 39:19-32, 2001.
• Augmentation to every 3 vertices in a cycle, P. Dankelmann, wdg, O. Oellermann, and H.C. Swart. Discrete Applied Math., 116:145-159, 2002.
• Domination in planar graphs with small diameter, wdg and M.A. Henning. J. Graph Theory, 40:1-25, 2002.
• A note on Steiner-distance-hereditary graphs, wdg. J. Combin. Math. Combin. Comput., 40:167-170, 2002.
• 4-connected maximal planar graphs are 4-orderable, wdg. Discrete Math., 257:405-410, 2002.
• More measures of vulnerability: Splinter sets and directed toughness, L.W. Beineke, wdg, and R. Vandell. Congr. Numer., 155:81-88, 2002.
• Changing upper irredundance by edge addition, E.J. Cockayne, O. Favaron, wdg, P.J.P. Grobler, and C.M. Mynhardt. Discrete Math., 266:185-193, 2003.
• Nordhaus-Gaddum bounds for independent domination, wdg and M.A. Henning. Discrete Math., 268:299-302, 2003.
• MAD trees and distance-hereditary graphs, E. Dalhaus, P. Dankelmann, wdg, and H.C. Swart. Discrete Applied Math., 131:151-167, 2003.
• Connectivity and distance measures in generalised prisms, wdg, M. Raines, and P. Slater. Discrete Math., 271:61-70, 2003.
• Clique/connected/total domination perfect graphs, wdg and M.A. Henning. Bull. Inst. Combin. Appl., 41:20-21, 2004.
• The average eccentricity of a graph and its subgraphs, P. Dankelmann, wdg, and C.S. Swart. Util. Math., 65:41-51, 2004.
• Maximum sizes of graphs with given domination parameters, P. Dankelmann, G.S. Domke, wdg, P. Grobler, J.H. Hattingh, and H.C. Swart. Discrete Math., 281(1-3):137-148, 2004.
• Minimum degree conditions for cycles including specified sets of vertices, wdg. Graphs Combin., 20(4):467-483, 2004.
• The diameter of total domination vertex critical graphs, wdg, T.W. Haynes, M.A. Henning, and L.C. van der Merwe. Discrete Math., 286(3):255-261, 2004.
• Augmenting trees to have two disjoint total dominating sets, I. Broere, M. Dorfling, wdg, J.H. Hattingh, M.A. Henning, and E. Ungerer. Bull. Inst. Combin. Appl., 42:12-18, 2004.
• Hereditary domination and independence parameters, wdg, T. Haynes, and D. Knisely. Discuss. Math. Graph Theory, 24:239-248, 2004.
• Offensive alliances, O. Favaron, G. Fricke, wdg, S.M. Hedetniemi, S.T. Hedetniemi, P. Kristiansen, R. Laskar, and D. Skaggs. Discussiones Math. Graph Theory, 24:263-275, 2004.
• Multiple vertex coverings by cliques, wdg and M.A. Henning. J. Graph Theory, 48(2):157-167, 2005.
• Eternal security in graphs, wdg, S.M. Hedetniemi, and S.T. Hedetniemi. J. Combin. Math. Combin. Comput., 52:169-180, 2005.
• Vertex coverings by coloured induced graphs-frames and umbrellas, M.A. Henning and wdg. Quaestiones Math., 28:1-10, 2005.
• On the extremal graphs for distance and $k$-diameter, wdg, C.S. Swart, and H.C. Swart. Math. Slovava, 55:131-139, 2005.
• Generalized subgraph-restricted matchings in graphs, wdg, S.M. Hedetniemi, S.T. Hedetniemi, and R. Laskar. Discrete Math., 293:129-138, 2005.
• Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets, M. Dorfling, wdg, J.H. Hattingh, and M.A. Henning. Discrete Math., 300:82-90, 2005.
• An algorithm for partial Grundy number on trees, Z. Shi, wdg, S.T. Hedetniemi, K. Kennedy, R. Laskar, and A. McRae. Discrete Math., 304:108-116, 2005.
• Domination of Planar Graphs II, M.S. Dorfling, wdg, and M.A. Henning. Ars Combin., 78:237-255, 2006.
• Domination equivalence in graphs, J.R.S. Blair, wdg, S.M. Hedetniemi, S.T. Hedetniemi, and S.B. Horton. AKCE International Journal of Graphs and Combinatorics, 2:123-136, 2006.
• A note on the integrity of trees, wdg. Utilitas Math., 69:227-232, 2006.
• Simultaneous graph parameters: Factor domination and factor total domination, P. Dankelmann, M.A. Henning, wdg, and R. Laskar. Discrete Math., 306:2229-2233, 2006.
• Construction of trees and graphs with equal domination parameters, M. Dorfling, wdg, M.A. Henning, and C.M. Mynhardt. Discrete Math., 306:2647-2654, 2006.
• The upper domination partition numbers of special graphs, J. Jacob, R. Laskar, and wdg. Congr. Numer., 182:65-77, 2006.
• Orientation distance graphs revisited, wdg and K. Kanakadandi. Discussiones Math. Graph Theory, 27:125-136, 2007.
• Restricted domination parameters in graphs, wdg and M.A. Henning. J. Combin. Optim., 13:353-363, 2007.
• Double vertex graphs and complete double vertex graphs, J. Jacob, wdg, and R. Laskar. In Proceedings of the Thirty-Eighth Southeastern International Conference on Combinatorics, Graph Theory and Computing, volume 188, pages 161-174, 2007.
• On domination numbers and reinforcement numbers in trees, J.R.S. Blair, wdg, S.T. Hedetniemi, S. Horton, P. Jones, and G.Kubicki. Discrete Math., 308:1165-1175, 2008.
• Broadcast chromatic numbers of graphs, wdg, S.M. Hedetniemi, S.T. Hedetniemi, J.M. Harris, and D.F. Rall. Ars Combin., 86:33-49, 2008.
• Minimal claw-free graphs, P. Dankelmann, H.C. Swart, P. van den Berg, wdg, and M.D. Plummer. Czechoslovak Math. J., 58(133)(3):787-798, 2008.
• On the Wimer method for designing edge-based algorithms, A. Jamieson, wdg, and S.T. Hedetniemi. AKCE International Journal of Graphs and Combinatorics, 5:115-125, 2008.
• A note on trees, tables, and algorithms, wdg and S.T. Hedetniemi. Networks, 53:184-190, 2009.
• Emergency response sets in graphs, J. Blair, wdg, S.M. Hedetniemi, S.T. Hedetniemi, F. Manne, and D. Rall. J. Combin. Math. Combin. Comput., 68:225-243, 2009.
• The binding number of a graph and its cliques, J. Lyle and wdg. Discrete Appl. Math., 157:3336-3340, 2009.