On the l-connectivity of a diagraph. - David P. Day; Ortrud R. Oellermann; Henda C. Swart (Discret. Math., 1994)

Steiner Distance-Hereditary Graphs. - David P. Day; Ortrud Oellermann; Henda C. Swart (SIAM J. Discret. Math., 1994)

A characterization of 3-Steiner distance hereditary graphs. - David P. Day; Ortrud Oellermann; Henda C. Swart (Networks, 1997)

Bounds on the size of graphs of given order and up/down-connectivity. - David P. Day; Ortrud R. Oellermann; Henda C. Swart (Discret. Math., 1999)

Multipartite Ramsey Numbers. - David P. Day; Wayne Goddard; Michael A. Henning; Henda C. Swart (Ars Comb., 2001)

On strong distances in oriented graphs. - Peter Dankelmann; Henda C. Swart; David P. Day (Discret. Math., 2003)

On equality in an upper bound for the restrained and total domination numbers of a graph. - Peter Dankelmann; David P. Day; Johannes H. Hattingh; Michael A. Henning; Lisa R. Markus; Henda C. Swart (Discret. Math., 2007)

Domination with exponential decay. - Peter Dankelmann; David P. Day; David Erwin; Simon Mukwembi; Henda C. Swart (Discret. Math., 2009)