The following pages link to C. St. J. A. Nash-Williams (Q1108283):
Displaying 24 items.
- Amalgamations of almost regular edge-colourings of simple graphs (Q1108284) (← links)
- Another proof of a theorem concerning detachments of graphs (Q1176032) (← links)
- Reconstruction of locally finite connected graphs with two infinite wings (Q1182943) (← links)
- Reconstruction of infinite graphs (Q1191922) (← links)
- Marriage in denumerable societies (Q1219283) (← links)
- The square of a block is Hamiltonian connected (Q1393413) (← links)
- Hamiltonian double Latin squares (Q1403912) (← links)
- Hamiltonian lines in infinite graphs with few vertices of smll valency (Q2552140) (← links)
- Simple constructions for balanced incomplete block designs with block size three (Q2559380) (← links)
- Rearrangement of vector series. I (Q2709858) (← links)
- Rearrangement of vector series. II (Q2709859) (← links)
- An Application of Network Flows to Rearrangement of Series (Q3128550) (← links)
- (Q3222884) (← links)
- (Q3263912) (← links)
- Decomposition of Graphs Into Closed and Endless Chains (Q3273707) (← links)
- On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs (Q3275434) (← links)
- Decomposition of Finite Graphs into Open Chains (Q3275435) (← links)
- (Q3281447) (← links)
- Decomposition of the <i>n</i>-Dimensional Lattice-Graph into Hamiltonian Lines (Q3283481) (← links)
- Edge-Disjoint Spanning Trees of Finite Graphs (Q3286077) (← links)
- Another Form of a Criterion for the Existence of Transversals (Q3328548) (← links)
- Hamiltonian Lines in Products of Infinite Trees (Q5333720) (← links)
- Plane Curves with Many Inscribed Rectangles (Q5654695) (← links)
- Decomposition of Finite Graphs Into Forests (Q5731396) (← links)
