Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
George R. T. Hendry
1990 – 1999
- 1998
[j14]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)- 1995
- [j13]George R. T. Hendry, Stephan Brandt: An extremal problem for cycles in hamiltonian graphs. Graphs and Combinatorics 11(3): 255-262 (1995)
- 1992
- [j12]George R. T. Hendry: An Ore-type sufficient condition for a bipancyclic ordering. Discrete Mathematics 102(1): 47-49 (1992)
- 1991
- [j11]George R. T. Hendry: Extending cycles in bipartite graphs. J. Comb. Theory, Ser. B 51(2): 292-313 (1991)
- 1990
- [j10]
1980 – 1989
- 1989
- [j9]George R. T. Hendry: Extending cycles in directed graphs. J. Comb. Theory, Ser. B 46(2): 162-172 (1989)
- [j8]George R. T. Hendry: Ramsey numbers for graphs with five vertices. Journal of Graph Theory 13(2): 245-248 (1989)
- [j7]George R. T. Hendry: A strengthening of Kikustapos;s theorem. Journal of Graph Theory 13(2): 257-260 (1989)
- [j6]
- 1988
- [j5]George R. T. Hendry: The multiplicity of 1-factors in total graphs. Discrete Mathematics 70(1): 21-25 (1988)
- [j4]George R. T. Hendry: Scattering number and extremal non-hamiltonian graphs. Discrete Mathematics 71(2): 165-175 (1988)
- [j3]George R. T. Hendry: On minimum degree in Hamiltonian path graphs. Journal of Graph Theory 12(4): 491-497 (1988)
- 1987
- [j2]George R. T. Hendry: On the hamiltonian path graph of a graph. Journal of Graph Theory 11(3): 373-384 (1987)
- 1984
- [j1]George R. T. Hendry: Maximum non-path-connected graphs. J. Comb. Theory, Ser. B 37(3): 294-298 (1984)
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-26 22:03 CEST by the dblp team