T. D. Parsons

According to our database1, T. D. Parsons authored at least 16 papers between 1971 and 1989.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

1989
Vector representations of graphs.
Discrete Mathematics, 1989

1988
Exotic n-universal graphs.
Journal of Graph Theory, 1988

1983
Embeddings of bipartite graphs.
Journal of Graph Theory, 1983

Hamiltonian paths in vertex-symmetric graphs of order 4p.
Discrete Mathematics, 1983

1982
A shortness exponent for r-regular r-connected graphs.
Journal of Graph Theory, 1982

Longest cycles in r-regular r-connected graphs.
J. Comb. Theory, Ser. B, 1982

Hamiltonian paths in vertex-symmetric graphs of order 5p.
Discrete Mathematics, 1982

1981
A duality theorem for graph embeddings.
Journal of Graph Theory, 1981

1980
Circulant graph imbeddings.
J. Comb. Theory, Ser. B, 1980

Dual imbeddings and wrapped quasi-coverings of graphs.
Discrete Mathematics, 1980

1979
Isomorphism of circulant graphs and digraphs.
Discrete Mathematics, 1979

1978
Paths extendable to cycles.
Journal of Graph Theory, 1978

1976
Ramsey Graphs and Block Designs.
J. Comb. Theory, Ser. A, 1976

1974
Path-cycle Ramsey numbers.
Discrete Mathematics, 1974

1973
The Ramsey numbers r(Pm, Kn).
Discrete Mathematics, 1973

1971
Hybrid programs: Linear and least-distance.
Math. Program., 1971


  Loading...