David P. Day

According to our database, David P. Day authored at least 8 papers between 1994 and 2009.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2009

Domination with exponential decay.

Peter Dankelmann, David P. Day, David Erwin, Simon Mukwembi, Henda C. Swart

Discret. Math., 2009

2007

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

2003

On strong distances in oriented graphs.

Peter Dankelmann, Henda C. Swart, David P. Day

Discret. Math., 2003

2001

Multipartite Ramsey Numbers.

David P. Day, Wayne Goddard, Michael A. Henning, Henda C. Swart

Ars Comb., 2001

1999

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

1997

A characterization of 3-Steiner distance hereditary graphs.

David P. Day, Ortrud Oellermann, Henda C. Swart

Networks, 1997

1994

Steiner Distance-Hereditary Graphs.

David P. Day, Ortrud Oellermann, Henda C. Swart

SIAM J. Discret. Math., 1994

On the l-connectivity of a diagraph.

David P. Day, Ortrud R. Oellermann, Henda C. Swart

Discret. Math., 1994