Nancy Eaton

According to our database1, Nancy Eaton authored at least 11 papers between 1992 and 2013.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2013
On the Erdős-Sós conjecture for graphs having no path with k+4 vertices.
Discrete Mathematics, 2013

2010
On the Erdos-Sos Conjecture and graphs with large minimum degree.
Ars Comb., 2010

2007
Tree representations of graphs.
Eur. J. Comb., 2007

2002
On pebbling threshold functions for graph sequences.
Discrete Mathematics, 2002

2000
A Near Packing of Two Graphs.
J. Comb. Theory, Ser. B, 2000

1998
Ramsey numbers for sparse graphs.
Discrete Mathematics, 1998

1997
Intersection Representation of Complete Unbalanced Bipartite Graphs.
J. Comb. Theory, Ser. B, 1997

1996
On p-intersection representations.
Journal of Graph Theory, 1996

Set intersection representations for almost all graphs.
Journal of Graph Theory, 1996

Graphs of Small Dimensions.
Combinatorica, 1996

1992
A Canonical Ramsey Theorem.
Random Struct. Algorithms, 1992


  Loading...