C. Nash-Williams

发表

Edge-disjoint spanning trees of finite graphs

C. Nash-Williams, 1961 .

Decomposition of Finite Graphs Into Forests

C. Nash-Williams, 1964 .

Infinite graphs—A survey

C. Nash-Williams, C.St.J.A. Nash-Williams, C. Nash-Williams, 1967 .

Random walk and electric currents in networks

C. Nash-Williams, C., St, 1959, Mathematical Proceedings of the Cambridge Philosophical Society.

Connected detachments of graphs and generalized Euler trails

C. Nash-Williams, C. Nash-Williams, 1985 .

On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs

C. Nash-Williams, 1960, Canadian Journal of Mathematics.

On Hamiltonian circuits in finite graphs

C. Nash-Williams, 1966 .

On well-quasi-ordering infinite trees

C. Nash-Williams, 1963, Mathematical Proceedings of the Cambridge Philosophical Society.

On Eulerian and Hamiltonian Graphs and Line Graphs

F. Harary, C. Nash-Williams, 1965, Canadian Mathematical Bulletin.

Hamiltonian arcs and circuits

C. Nash-Williams, C.St. J. A. Nash-Williams, 1971 .

Hamiltonian circuits in graphs and digraphs

C. Nash-Williams, C.St. J. A. Nash-Williams, 1969 .

On better-quasi-ordering transfinite sequences

C. St. J. A. Nash-Williams, C. Nash-Williams, C. St. J. A. Nash-Williams, 1968, Mathematical Proceedings of the Cambridge Philosophical Society.

Detachments of graphs and generalised Euler trails

Ian Anderson, C. Nash-Williams, I. Anderson, 1985 .

A GLANCE AT GRAPH THEORY — PART II

C. Nash-Williams, 1982 .

Another Form of a Criterion for the Existence of Transversals

S. Shelah, C. Nash-Williams, R. Aharoni, 1984 .

A General Criterion for the Existence of Transversals

Saharon Shelah, C. St. J. A. Nash-Williams, S. Shelah, 1983 .

Another Criterion for Marriage in Denumerable Societies

C. St. J. A. Nash-Williams, C. Nash-Williams, 1978 .

On well-quasi-ordering transfinite sequences

C. St. J. A. Nash-Williams, C. Nash-Williams, 1965, Mathematical Proceedings of the Cambridge Philosophical Society.

A Glance at Graph Theory—Part I

C. St. J. A. Nash-Williams, C. Nash-Williams, 1982 .

On well-quasi-ordering lower sets of finite trees

C. St. J. A. Nash-Williams, C. Nash-Williams, 1964, Mathematical Proceedings of the Cambridge Philosophical Society.

Marriage in Denumerable Societies

C. St. J. A. Nash-Williams, C. Nash-Williams, 1975, J. Comb. Theory, Ser. A.

Applications of Graph Theory to Group Structure

Claude Flament, C. St. J. A. Nash-Williams, C. Nash-Williams, 1966, The Mathematical Gazette.

Decomposition of Graphs Into Closed and Endless Chains

C. St. J. A. Nash-Williams, C. Nash-Williams, 1960 .

Abelian groups, graphs and generalized knights

C. St. J. A. Nash-Williams, C. Nash-Williams, 1959, Mathematical Proceedings of the Cambridge Philosophical Society.

Rearrangement of vector series. I

D. J. White, C. Nash-Williams, 2001, Mathematical Proceedings of the Cambridge Philosophical Society.

Hamiltonian lines in infinite graphs with few vertices of small valency

C. Nash-Williams, 1971 .

On well-quasi-ordering finite trees

C. Nash-Williams, J. A. Nash-Williams, 1963, Mathematical Proceedings of the Cambridge Philosophical Society.

Hamiltonian double latin squares

Anthony J. W. Hilton, Christopher A. Rodger, Michael E. Mays, 2003, J. Comb. Theory, Ser. B.

Decomposition of the n-Dimensional Lattice-Graph into Hamiltonian Lines

C. Nash-Williams, 1961, Proceedings of the Edinburgh Mathematical Society.

Decomposition of Graphs into Two-Way Infinite Paths

C. St. J. A. Nash-Williams, C. Nash-Williams, 1963, Canadian Journal of Mathematics.