Torrence D. Parsons

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1989
Vector representations of graphs.
Discret. Math., 1989

1988
Exotic <i>n</i>-universal graphs.
J. Graph Theory, 1988

Intersection Graphs for Families of Balls in R<sup>n</sup>.
Eur. J. Comb., 1988

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

Hamiltonian paths in vertex-symmetric graphs of order 4p.
Discret. Math., 1983

1982
A shortness exponent for <i>r</i>-regular <i>r</i>-connected graphs.
J. Graph Theory, 1982

Longest cycles in <i>r</i>-regular <i>r</i>-connected graphs.
J. Comb. Theory B, 1982

Hamiltonian paths in vertex-symmetric graphs of order 5p.
Discret. Math., 1982

1981
A duality theorem for graph embeddings.
J. Graph Theory, 1981

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

Dual imbeddings and wrapped quasi-coverings of graphs.
Discret. Math., 1980

1979
Isomorphism of circulant graphs and digraphs.
Discret. Math., 1979

1978
Paths extendable to cycles.
J. Graph Theory, 1978

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

1974
Path-cycle Ramsey numbers.
Discret. Math., 1974

1973
The Ramsey numbers r(P<sub>m</sub>, K<sub>n</sub>).
Discret. Math., 1973

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


  Loading...