David P. Sumner

According to our database, David P. Sumner authored at least 14 papers between 1973 and 2007.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2007

gamma-Excellent, critically dominated, end-dominated, and dot-critical trees are equivalent.

Tamara Burton, David P. Sumner

Discret. Math., 2007

2006

Domination dot-critical graphs.

Tamara Burton, David P. Sumner

Discret. Math., 2006

1994

The diameter of domination <i>k</i>-critical graphs.

Odile Favaron, David P. Sumner, Ewa Wojcicka

J. Graph Theory, 1994

1990

Critical concepts in domination.

David P. Sumner

Discret. Math., 1990

1985

Longest paths and cycles in K_{1, 3}-free graphs.

Manton M. Matthews, David P. Sumner

J. Graph Theory, 1985

1984

Hamiltonian results in <i>K</i>_{1, 3}-free graphs.

Manton M. Matthews, David P. Sumner

J. Graph Theory, 1984

1983

Domination critical graphs.

David P. Sumner, Pattie Blitch

J. Comb. Theory B, 1983

1979

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

1978

An upper bound on the size of a largest clique in a graph.

Dennis P. Geoffroy, David P. Sumner

J. Graph Theory, 1978

The edge nucleus of a point-determining graph.

Dennis P. Geoffroy, David P. Sumner

J. Comb. Theory B, 1978

The connected Ramsey number.

David P. Sumner

Discret. Math., 1978

1976

The nucleus of a point determining graph.

David P. Sumner

Discret. Math., 1976

1973

Point determination in graphs.

David P. Sumner

Discret. Math., 1973

Graphs indecomposable with respect to the X-join.

David P. Sumner

Discret. Math., 1973