C. St. J. A. Nash-Williams - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 12 from 12

2003

Hamiltonian double latin squaresAnthony J. W. Hilton, Michael E. Mays, Christopher A. Rodger, C. St. J. A. Nash-Williams. JCT, 87(1):81-129, 2003. [doi]

1994

Reconstructing the number of copies of a valency-labeled finite graph in an infinite graphA. J. H. King, C. St. J. A. Nash-Williams. jgt, 18(2):109-117, 1994. [doi]

Infinite digraphs with nonreconstructible outvalency sequencesC. St. J. A. Nash-Williams. jgt, 18(5):535-537, 1994. [doi]

1991

Reconstruction of infinite graphsC. St. J. A. Nash-Williams. DM, 95(1-3):221-229, 1991. [doi]

Reconstruction of locally finite connected graphs with two infinite wingsC. St. J. A. Nash-Williams. DM, 92(1-3):227-249, 1991. [doi]

IntroductionC. St. J. A. Nash-Williams. DM, 95(1-3):3-4, 1991.

Another Proof of a Theorem Concerning Detachments of GraphsC. St. J. A. Nash-Williams. ejc, 12(3):245-247, 1991. [doi]

1987

Amalgamations of almost regular edge-colourings of simple graphsC. St. J. A. Nash-Williams. JCT, 43(3):322-342, 1987. [doi]

Reconstruction of locally finite connected graphs with at least three infinite wingsC. St. J. A. Nash-Williams. jgt, 11(4):497-505, 1987. [doi]

1977

More proofs of menger's theoremC. St. J. A. Nash-Williams, W. T. Tutte. jgt, 1(1):13-17, 1977. [doi]

1975

Marriage in Denumerable SocietiesC. St. J. A. Nash-Williams. JCT, 19(3):335-366, 1975.

1972

Simple Constructions for Balanced Incomplete Block Designs with Block Size ThreeC. St. J. A. Nash-Williams. JCT, 13(1):1-6, 1972.

Sign in or sign up to see more results.

runs on WebDSL