David P. Day

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2009
Domination with exponential decay.
Discret. Math., 2009

2007
On equality in an upper bound for the restrained and total domination numbers of a graph.
Discret. Math., 2007

2003
On strong distances in oriented graphs.
Discret. Math., 2003

2001
Multipartite Ramsey Numbers.
Ars Comb., 2001

1999
Bounds on the size of graphs of given order and up/down-connectivity.
Discret. Math., 1999

1997
A characterization of 3-Steiner distance hereditary graphs.
Networks, 1997

1994
Steiner Distance-Hereditary Graphs.
SIAM J. Discret. Math., 1994

On the l-connectivity of a diagraph.
Discret. Math., 1994


  Loading...