Robert Woodrow

Journal Paper

• Laviolette, Fran , Sauer, Norbert and Woodrow, Robert. On cop-win graphs 258.1-3 2002. 27-41.
• Fouquet, Jean , Tuza, Zsolt and Woodrow, Robert. On magnitude networks 133. 1998. 75-84.
• Sauer, Norbert, Woodrow, Robert and R{\"o}dl, Vojtech . Chromatic {R}amsey theory 18.1 1997. 93-102.
• Macpherson, H. D., Pouzet, M. and Woodrow, Robert. Countable structures of given age 57.3 1992. 992-1010.
• Duffus, Dwight, R{\"o}dl, V. , Sauer, Norbert and Woodrow, Robert. Coloring ordered sets to avoid monochromatic maximal chains 44.1 1992. 91-103.
• Pouzet, Maurice , Woodrow, Robert and Zaguia, Nejib . Generating boxes from ordered sets and graphs 9.2 1992. 111-126.
• Duffus, Dwight, R{\"o}dl, Vojt , Sands, Bill and Woodrow, Robert. Enumeration of order preserving maps 9.1 1992. 15-29.
• Macpherson, Dugald and Woodrow, Robert. The permutation group induced on a moiety 4.3 1992. 243-255.
• Duffus, Dwight, Sands, Bill, Sauer, Norbert and Woodrow, Robert. Two-colouring all two-element maximal antichains 57.1 1991. 109-116.
• Milner, Eric C. and Woodrow, Robert. Infinite friendship graphs with infinite parameters 52.1 1991. 30-41.
• Brown, Jason I., Kelly, David , Sch{\"o}nheim, J. and Woodrow, Robert. Graph coloring satisfying restraints 80.2 1990. 123-143.
• Bonnet, R. , Duffus, Dwight and Woodrow, Robert. Coloring chains 6.1 1989. 69-89.
• Milner, E. C. and Woodrow, Robert. On directed graphs with an independent covering set 5.4 1989. 363-369.
• Duffus, Dwight, Sands, Bill and Woodrow, Robert. Lexicographic matchings cannot form {H}amiltonian cycles 5.2 1988. 149-161.
• Duffus, Dwight, Sands, Bill and Woodrow, Robert. On the chromatic number of the product of graphs 9.4 1985. 487-495.
• Sauer, Norbert and Woodrow, Robert. Finite cutsets and finite antichains 1.1 1984. 35-46.
• Woodrow, Robert and Knight, Julia F.. A complete theory with arbitrarily large minimality ranks 48.2 1983. 321-328.
• Sands, Bill, Sauer, Norbert and Woodrow, Robert. On monochromatic paths in edge-coloured digraphs 33.3 1982. 271-275.
• Rose, Bruce I. and Woodrow, Robert. Ultrahomogeneous structures 27.1 1981. 23-30.
• Lachlan, A. H. and Woodrow, Robert. Countable ultrahomogeneous undirected graphs 262.1 1980. 51-94.
• Woodrow, Robert. There are four countable ultrahomogeneous graphs without triangles 27.2 1979. 168-179.
• Woodrow, Robert. Theories with a finite number of countable models 43.3 1978. 442-455.
• Woodrow, Robert. A note on countable complete theories having three isomorphism types of countable models 41.3 1976. 672-680.