2005 |
13 | EE | Peter C. Gibson,
Maurice Pouzet,
Robert E. Woodrow:
Relational structures having finitely many full-cardinality restrictions.
Discrete Mathematics 291(1-3): 115-134 (2005) |
2004 |
12 | EE | Gena Hahn,
Pierre Ille,
Robert E. Woodrow:
Absorbing sets in arc-coloured tournaments.
Discrete Mathematics 283(1-3): 93-99 (2004) |
2002 |
11 | EE | Gena Hahn,
François Laviolette,
Norbert Sauer,
Robert E. Woodrow:
On cop-win graphs.
Discrete Mathematics 258(1-3): 27-41 (2002) |
1997 |
10 | EE | Norbert Sauer,
Robert E. Woodrow,
Vojtech Rödl:
Chromatic Ramsey Theory.
Eur. J. Comb. 18(1): 93-102 (1997) |
1992 |
9 | | H. D. Macpherson,
Maurice Pouzet,
Robert E. Woodrow:
Countable Structures of Given Age.
J. Symb. Log. 57(3): 992-1010 (1992) |
1991 |
8 | EE | Dwight Duffus,
Bill Sands,
Norbert Sauer,
Robert E. Woodrow:
Two-colouring all two-element maximal antichains.
J. Comb. Theory, Ser. A 57(1): 109-116 (1991) |
7 | EE | Gena Hahn,
Eric C. Milner,
Robert E. Woodrow:
Infinite friendship graphs with infinite parameters.
J. Comb. Theory, Ser. B 52(1): 30-41 (1991) |
1990 |
6 | EE | Jason I. Brown,
David Kelly,
J. Schönheim,
Robert E. Woodrow:
Graph coloring satisfying restraints.
Discrete Mathematics 80(2): 123-143 (1990) |
1983 |
5 | | Robert E. Woodrow,
Julia F. Knight:
A Complete Theory with Arbitrarily Large Minimality Ranks.
J. Symb. Log. 48(2): 321-328 (1983) |
1982 |
4 | EE | Bill Sands,
Norbert Sauer,
Robert E. Woodrow:
On monochromatic paths in edge-coloured digraphs.
J. Comb. Theory, Ser. B 33(3): 271-275 (1982) |
1979 |
3 | EE | Robert E. Woodrow:
There are four countable ultrahomogeneous graphs without triangles.
J. Comb. Theory, Ser. B 27(2): 168-179 (1979) |
1978 |
2 | | Robert E. Woodrow:
Theories with a Finite Number of Countable Models.
J. Symb. Log. 43(3): 442-455 (1978) |
1976 |
1 | | Robert E. Woodrow:
A Note on Countable Complete Theories Having Three Isomorphism Types of Countable Models.
J. Symb. Log. 41(3): 672-680 (1976) |