Crispin St. John Alvah Nash-Williams

According to our database, Crispin St. John Alvah Nash-Williams authored at least 12 papers between 1972 and 2003.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2003

Hamiltonian double latin squares.

Anthony J. W. Hilton, Michael E. Mays, Christopher A. Rodger, Crispin St. John Alvah Nash-Williams

J. Comb. Theory, Ser. B, 2003

1994

Infinite digraphs with nonreconstructible outvalency sequences.

Crispin St. John Alvah Nash-Williams

J. Graph Theory, 1994

Reconstructing the number of copies of a valency-labeled finite graph in an infinite graph.

A. J. H. King, Crispin St. John Alvah Nash-Williams

J. Graph Theory, 1994

1991

Another Proof of a Theorem Concerning Detachments of Graphs.

Crispin St. John Alvah Nash-Williams

Eur. J. Comb., 1991

Reconstruction of infinite graphs.

Crispin St. John Alvah Nash-Williams

Discret. Math., 1991

Introduction.

Crispin St. John Alvah Nash-Williams

Discret. Math., 1991

Reconstruction of locally finite connected graphs with two infinite wings.

Crispin St. John Alvah Nash-Williams

Discret. Math., 1991

1987

Reconstruction of locally finite connected graphs with at least three infinite wings.

Crispin St. John Alvah Nash-Williams

J. Graph Theory, 1987

Amalgamations of almost regular edge-colourings of simple graphs.

Crispin St. John Alvah Nash-Williams

J. Comb. Theory, Ser. B, 1987

1977

More proofs of menger's theorem.

Crispin St. John Alvah Nash-Williams, W. T. Tutte

J. Graph Theory, 1977

1975

Marriage in Denumerable Societies.

Crispin St. John Alvah Nash-Williams

J. Comb. Theory, Ser. A, 1975

1972

Simple Constructions for Balanced Incomplete Block Designs with Block Size Three.

Crispin St. John Alvah Nash-Williams

J. Comb. Theory, Ser. A, 1972