Search the dblp DataBase
George R. T. Hendry: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- George R. T. Hendry
Maximum non-path-connected graphs. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1984, v:37, n:3, pp:294-298 [Journal] - George R. T. Hendry
Extending cycles in directed graphs. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1989, v:46, n:2, pp:162-172 [Journal] - George R. T. Hendry
Extending cycles in bipartite graphs. [Citation Graph (0, 0)][DBLP]
J. Comb. Theory, Ser. B, 1991, v:51, n:2, pp:292-313 [Journal] - George R. T. Hendry
The multiplicity of 1-factors in total graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1988, v:70, n:1, pp:21-25 [Journal] - George R. T. Hendry
Scattering number and extremal non-hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1988, v:71, n:2, pp:165-175 [Journal] - George R. T. Hendry, C. J. Knickerbocker, Patti Frazer Lock, Michael Sheard
Forbidden subgraphs of graphs uniquely Hamiltonian-connected from a vertex. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1998, v:187, n:1-3, pp:281-290 [Journal] - George R. T. Hendry
Extending cycles in graphs. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1990, v:85, n:1, pp:59-72 [Journal] - George R. T. Hendry
An Ore-type sufficient condition for a bipancyclic ordering. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1992, v:102, n:1, pp:47-49 [Journal]
Search in 0.001secs, Finished in 0.001secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002