T. D. Parsons - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 16 from 16

1989

Vector representations of graphsT. D. Parsons, Tomaz Pisanski. DM, 78(1-2):143-154, 1989. [doi]

1988

n-universal graphsT. D. Parsons, Tomaz Pisanski. jgt, 12(2):155-158, 1988. [doi]

1983

Embeddings of bipartite graphsMohammed Abu-Sbeih, T. D. Parsons. jgt, 7(3):325-334, 1983. [doi]

Hamiltonian paths in vertex-symmetric graphs of order 4pDragan Marusic, T. D. Parsons. DM, 43(1):91-96, 1983. [doi]

1982

Longest cycles in ::::r::::-regular ::::r::::-connected graphsBrad Jackson, T. D. Parsons. JCT, 32(3):231-245, 1982. [doi]

r-connected graphsBrad Jackson, T. D. Parsons. jgt, 6(2):169-176, 1982. [doi]

Hamiltonian paths in vertex-symmetric graphs of order 5pDragan Marusic, T. D. Parsons. DM, 42(2-3):227-242, 1982. [doi]

1981

A duality theorem for graph embeddingsBrad Jackson, T. D. Parsons, Tomaz Pisanski. jgt, 5(1):55-77, 1981. [doi]

1980

Dual imbeddings and wrapped quasi-coverings of graphsT. D. Parsons, Tomaz Pisanski, Brad Jackson. DM, 31(1):43-52, 1980. [doi]

Circulant graph imbeddingsT. D. Parsons. JCT, 29(3):310-320, 1980. [doi]

1979

Isomorphism of circulant graphs and digraphsBrian Alspach, T. D. Parsons. DM, 25(2):97-108, 1979. [doi]

1978

Paths extendable to cyclesT. D. Parsons. jgt, 2(4):337-339, 1978. [doi]

1976

Ramsey Graphs and Block DesignsT. D. Parsons. JCT, 20(1):12-19, 1976.

1974

Path-cycle Ramsey numbersRalph J. Faudree, S. L. Lawrence, T. D. Parsons, Richard H. Schelp. DM, 10(2):269-277, 1974. [doi]

1973

n)T. D. Parsons. DM, 6(2):159-162, 1973. [doi]

1971

Hybrid programs: Linear and least-distanceT. D. Parsons, A. W. Tucker. mp, 1(1):153-167, 1971. [doi]

Sign in or sign up to see more results.

runs on WebDSL