| |
| 1998 | ||
|---|---|---|
| 8 | EE | George R. T. Hendry, C. J. Knickerbocker, Patti Frazer Lock, Michael Sheard: Forbidden subgraphs of graphs uniquely Hamiltonian-connected from a vertex. Discrete Mathematics 187(1-3): 281-290 (1998) |
| 1992 | ||
| 7 | EE | George R. T. Hendry: An Ore-type sufficient condition for a bipancyclic ordering. Discrete Mathematics 102(1): 47-49 (1992) |
| 1991 | ||
| 6 | EE | George R. T. Hendry: Extending cycles in bipartite graphs. J. Comb. Theory, Ser. B 51(2): 292-313 (1991) |
| 1990 | ||
| 5 | EE | George R. T. Hendry: Extending cycles in graphs. Discrete Mathematics 85(1): 59-72 (1990) |
| 1989 | ||
| 4 | EE | George R. T. Hendry: Extending cycles in directed graphs. J. Comb. Theory, Ser. B 46(2): 162-172 (1989) |
| 1988 | ||
| 3 | EE | George R. T. Hendry: The multiplicity of 1-factors in total graphs. Discrete Mathematics 70(1): 21-25 (1988) |
| 2 | EE | George R. T. Hendry: Scattering number and extremal non-hamiltonian graphs. Discrete Mathematics 71(2): 165-175 (1988) |
| 1984 | ||
| 1 | EE | George R. T. Hendry: Maximum non-path-connected graphs. J. Comb. Theory, Ser. B 37(3): 294-298 (1984) |
| 1 | C. J. Knickerbocker | [8] |
| 2 | Patti Frazer Lock | [8] |
| 3 | Michael Sheard | [8] |