| |
| 1997 | ||
|---|---|---|
| 4 | EE | David M. Berman, A. J. Radcliffe, Alex D. Scott, Hong Wang, Larry Wargo: All trees contain a large induced subgraph having all degrees 1 (mod k). Discrete Mathematics 175(1-3): 35-40 (1997) |
| 1991 | ||
| 3 | EE | Michael O. Albertson, David M. Berman: The number of cut-vertices in a graph of given minimum degree. Discrete Mathematics 89(1): 97-100 (1991) |
| 1980 | ||
| 2 | EE | Michael O. Albertson, David M. Berman: Critical graphs for chromatic difference sequences. Discrete Mathematics 31(3): 225-233 (1980) |
| 1 | EE | Michael O. Albertson, David M. Berman: The chromatic difference sequence of a graph. J. Comb. Theory, Ser. B 29(1): 1-12 (1980) |
| 1 | Michael O. Albertson | [1] [2] [3] |
| 2 | A. J. Radcliffe | [4] |
| 3 | Alex D. Scott (Alexander D. Scott) | [4] |
| 4 | Hong Wang | [4] |
| 5 | Larry Wargo | [4] |