David P. Sumner

14 papers Journal 14
YearRankTypeTitle / Venue / Authors
2007 J jnl
gamma-Excellent, critically dominated, end-dominated, and dot-critical trees are equivalent.
Discret. Math.
Tamara Burton, David P. Sumner
2006 J jnl
Domination dot-critical graphs.
Discret. Math.
Tamara Burton, David P. Sumner
1994 J jnl
The diameter of domination
J. Graph Theory
Odile Favaron, David P. Sumner, Ewa Wojcicka
1990 J jnl
Critical concepts in domination.
Discret. Math.
David P. Sumner
1985 J jnl
Longest paths and cycles in K
J. Graph Theory
Manton M. Matthews, David P. Sumner
1984 J jnl
Hamiltonian results in
J. Graph Theory
Manton M. Matthews, David P. Sumner
1983 J jnl
Domination critical graphs.
J. Comb. Theory B
David P. Sumner, Pattie Blitch
1979 J jnl
Every connected, locally connected nontrivial graph with no induced claw is hamiltonian.
J. Graph Theory
David J. Oberly, Slobodan K. Simic, David P. Sumner
1978 J jnl
An upper bound on the size of a largest clique in a graph.
J. Graph Theory
Dennis P. Geoffroy, David P. Sumner
1978 J jnl
The connected Ramsey number.
Discret. Math.
David P. Sumner
1978 J jnl
The edge nucleus of a point-determining graph.
J. Comb. Theory B
Dennis P. Geoffroy, David P. Sumner
1976 J jnl
The nucleus of a point determining graph.
Discret. Math.
David P. Sumner
1973 J jnl
Graphs indecomposable with respect to the X-join.
Discret. Math.
David P. Sumner
1973 J jnl
Point determination in graphs.
Discret. Math.
David P. Sumner