George Hendry

According to our database1, George Hendry authored at least 1 paper in 1985.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1985
The square of a connected S(K<sub>1, 3</sub>)-free graph is vertex pancyclic.
J. Graph Theory, 1985


  Loading...