| | |
- CSB - MetaPress - Google - Bing - Yahoo
 | 2001 | |
|---|---|---|
| 4 |      | Robert A. Beezer, John E. Riegsecker, Bryan A. Smith: Using minimum degree to bound average distance. Discrete Mathematics 226(1-3): 365-371 (2001) |
| 3 | | Robert A. Beezer: Counting Configurations in Designs. J. Comb. Theory, Ser. A 96(2): 341-357 (2001) |
| 1995 | ||
| 2 | | Robert A. Beezer, E. J. Farrell: The matching polynomial of a regular graph. Discrete Mathematics 137(1-3): 7-18 (1995) |
| 1987 | ||
| 1 | | Robert A. Beezer: Orbit polynomial graphs of prime order. Discrete Mathematics 67(2): 139-147 (1987) |
| 1 | E. J. Farrell | [2] |
| 2 | John E. Riegsecker | [4] |
| 3 | Bryan A. Smith | [4] |
Colors in the list of coauthors
Last update Sun May 27 04:04:01 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page