Improved bounds for the number of forests and acyclic orientations in the square lattice. Calkin, N., Merino, C., Noble, S., Noy, M. (2003) The Electronic Journal of Combinatorics [electronic only]
Improved upper bounds for self-avoiding walks in ℤ d . Pönitz, André, Tittmann, Peter (2000) The Electronic Journal of Combinatorics [electronic only]
Independent sets on path-schemes. Kitaev, Sergey (2006) Journal of Integer Sequences [electronic only]
Intersections of randomly embedded sparse graphs are Poisson. Bender, Edward A., Canfield, E.Rodney (1999) The Electronic Journal of Combinatorics [electronic only]