C. St. J. A. Nash-Williams

From MaRDI portal
Revision as of 09:08, 24 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:1108283

Available identifiers

zbMath Open nash-williams.crispin-st-j-aWikidataQ3002796 ScholiaQ3002796MaRDI QIDQ1108283

List of research outcomes





PublicationDate of PublicationType
Hamiltonian double Latin squares2003-08-20Paper
Rearrangement of vector series. II2002-05-01Paper
Rearrangement of vector series. I2002-04-16Paper
Eric Charles Milner2000-06-22Paper
An Application of Network Flows to Rearrangement of Series1997-09-11Paper
https://portal.mardi4nfdi.de/entity/Q48623341996-11-05Paper
https://portal.mardi4nfdi.de/entity/Q48623541996-11-05Paper
Infinite digraphs with nonreconstructible outvalency sequences1995-01-02Paper
Reconstructing the number of copies of a valency‐labeled finite graph in an infinite graph1994-09-11Paper
Reconstruction of infinite graphs1992-09-27Paper
Reconstruction of locally finite connected graphs with two infinite wings1992-06-28Paper
Another proof of a theorem concerning detachments of graphs1992-06-25Paper
Amalgamations of almost regular edge-colourings of simple graphs1987-01-01Paper
Reconstruction of locally finite connected graphs with at least three infinite wings1987-01-01Paper
Connected Detachments of Graphs and Generalized Euler Trails1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36917831985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32228841984-01-01Paper
Another Form of a Criterion for the Existence of Transversals1984-01-01Paper
A General Criterion for the Existence of Transversals1983-01-01Paper
A Glance at Graph Theory-Part I1982-01-01Paper
A Glance at Graph Theory-Part II1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38567811979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39150191979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38709361978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41707471978-01-01Paper
Another Criterion for Marriage in Denumerable Societies1978-01-01Paper
More proofs of menger's theorem1977-01-01Paper
Marriage in denumerable societies1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40888491975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41178381975-01-01Paper
The square of a block is Hamiltonian connected1974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56788821973-01-01Paper
Simple constructions for balanced incomplete block designs with block size three1972-01-01Paper
Plane Curves with Many Inscribed Rectangles1972-01-01Paper
Hamiltonian lines in infinite graphs with few vertices of smll valency1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56222091971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56281621971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56281631971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47773431970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56252171970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56369101970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55913871969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55946211969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56116491969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55376291968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55729501968-01-01Paper
Infinite graphs—A survey1967-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55829101967-01-01Paper
On Hamiltonian Circuits in Finite Graphs1966-01-01Paper
Euler Lines in Infinite Directed Graphs1966-01-01Paper
Hamiltonian Lines in Products of Infinite Trees1965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q53372041965-01-01Paper
On Eulerian and Hamiltonian Graphs and Line Graphs1965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55205691965-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55539191964-01-01Paper
Decomposition of Finite Graphs Into Forests1964-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57352261964-01-01Paper
Decomposition of Graphs into Two-Way Infinite Paths1963-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57344361963-01-01Paper
Decomposition of Finite Graphs into Open Chains1961-01-01Paper
Decomposition of the n-Dimensional Lattice-Graph into Hamiltonian Lines1961-01-01Paper
Edge-Disjoint Spanning Trees of Finite Graphs1961-01-01Paper
Decomposition of Graphs Into Closed and Endless Chains1960-01-01Paper
On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs1960-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32639121959-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32814471959-01-01Paper

Research outcomes over time

This page was built for person: C. St. J. A. Nash-Williams