Graphs indecomposable with respect to the X-join. - David P. Sumner (Discret. Math., 1973)

Point determination in graphs. - David P. Sumner (Discret. Math., 1973)

The nucleus of a point determining graph. - David P. Sumner (Discret. Math., 1976)

The connected Ramsey number. - David P. Sumner (Discret. Math., 1978)

The edge nucleus of a point-determining graph. - Dennis P. Geoffroy; David P. Sumner (J. Comb. Theory B, 1978)

An upper bound on the size of a largest clique in a graph. - Dennis P. Geoffroy; David P. Sumner (J. Graph Theory, 1978)

Every connected, locally connected nontrivial graph with no induced claw is hamiltonian. - David J. Oberly; Slobodan K. Simic; David P. Sumner (J. Graph Theory, 1979)

Domination critical graphs. - David P. Sumner; Pattie Blitch (J. Comb. Theory B, 1983)

Hamiltonian results in K1, 3-free graphs. - Manton M. Matthews; David P. Sumner (J. Graph Theory, 1984)

Longest paths and cycles in K1, 3-free graphs. - Manton M. Matthews; David P. Sumner (J. Graph Theory, 1985)

Critical concepts in domination. - David P. Sumner (Discret. Math., 1990)

The diameter of domination k-critical graphs. - Odile Favaron; David P. Sumner; Ewa Wojcicka (J. Graph Theory, 1994)

Domination dot-critical graphs. - Tamara Burton; David P. Sumner (Discret. Math., 2006)

gamma-Excellent, critically dominated, end-dominated, and dot-critical trees are equivalent. - Tamara Burton; David P. Sumner (Discret. Math., 2007)