George R. T. Hendry

According to our database1, George R. T. Hendry authored at least 21 papers between 1984 and 1998.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1998
Forbidden subgraphs of graphs uniquely Hamiltonian-connected from a vertex.
Discret. Math., 1998

1995
The ramsey number <i>r</i>(<i>k</i><sub>1</sub> + <i>c</i><sub>4</sub>, <i>k</i><sub>5</sub> - <i>e</i>).
J. Graph Theory, 1995

An extremal problem for cycles in hamiltonian graphs.
Graphs Comb., 1995

1992
An Ore-type sufficient condition for a bipancyclic ordering.
Discret. Math., 1992

1991
Extending cycles in bipartite graphs.
J. Comb. Theory B, 1991

1990
Extending cycles in graphs.
Discret. Math., 1990

1989
On mean distance in certain classes of graphs.
Networks, 1989

A strengthening of Kikustapos;s theorem.
J. Graph Theory, 1989

Ramsey numbers for graphs with five vertices.
J. Graph Theory, 1989

Extending cycles in directed graphs.
J. Comb. Theory B, 1989

1988
On minimum degree in Hamiltonian path graphs.
J. Graph Theory, 1988

Scattering number and extremal non-hamiltonian graphs.
Discret. Math., 1988

The multiplicity of 1-factors in total graphs.
Discret. Math., 1988

1987
On the hamiltonian path graph of a graph.
J. Graph Theory, 1987

1986
Existence of graphs with prescribed mean distance.
J. Graph Theory, 1986

The size of graphs uniquely hamiltonian-connected from a vertex.
Discret. Math., 1986

1985
On graphs with prescribed median I.
J. Graph Theory, 1985

1984
The multiplicity of 1-factors in the square of a graph.
J. Graph Theory, 1984

Maximum non-path-connected graphs.
J. Comb. Theory B, 1984

Maximum graphs with a unique <i>k</i>-factor.
J. Comb. Theory B, 1984

Graphs uniquely hamiltonian-connected from a vertex.
Discret. Math., 1984


  Loading...