Robert E. Woodrow

According to our database1, Robert E. Woodrow authored at least 26 papers between 1976 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
A universal partition result for infinite homogeneous Kn-free and related graphs.
Discret. Math., 2021

2019
Fractal graphs.
J. Graph Theory, 2019

Balanced independent sets in graphs omitting large cliques.
J. Comb. Theory, Ser. B, 2019

2017
Criticality of switching classes of reversible 2-structures labeled by an Abelian group.
Discuss. Math. Graph Theory, 2017

Equimorphy: the case of chains.
Arch. Math. Log., 2017

2014
Ramsey Precompact Expansions of Homogeneous Directed Graphs.
Electron. J. Comb., 2014

2013
A Reduction Theorem for the Kripke-Joyal Semantics: Forcing Over an Arbitrary Category can Always be Replaced by Forcing Over a Complete Heyting Algebra.
Logica Universalis, 2013

Convex sublattices of a lattice and a fixed point property.
Contributions Discret. Math., 2013

2011
Decomposition tree of a lexicographic product of binary structures.
Discret. Math., 2011

2009
Weakly partitive families on infinite sets.
Contributions Discret. Math., 2009

2005
Relational structures having finitely many full-cardinality restrictions.
Discret. Math., 2005

2004
Absorbing sets in arc-coloured tournaments.
Discret. Math., 2004

2002
On cop-win graphs.
Discret. Math., 2002

1997
Chromatic Ramsey Theory.
Eur. J. Comb., 1997

1992
Countable Structures of Given Age.
J. Symb. Log., 1992

1991
Infinite friendship graphs with infinite parameters.
J. Comb. Theory, Ser. B, 1991

Two-colouring all two-element maximal antichains.
J. Comb. Theory, Ser. A, 1991

1990
Graph coloring satisfying restraints.
Discret. Math., 1990

1989
On directed graphs with an independent covering set.
Graphs Comb., 1989

1985
On the chromatic number of the product of graphs.
J. Graph Theory, 1985

1983
A Complete Theory with Arbitrarily Large Minimality Ranks.
J. Symb. Log., 1983

1982
On monochromatic paths in edge-coloured digraphs.
J. Comb. Theory, Ser. B, 1982

1981
Ultrahomogeneous Structures.
Math. Log. Q., 1981

1979
There are four countable ultrahomogeneous graphs without triangles.
J. Comb. Theory, Ser. B, 1979

1978
Theories with a Finite Number of Countable Models.
J. Symb. Log., 1978

1976
A Note on Countable Complete Theories Having Three Isomorphism Types of Countable Models.
J. Symb. Log., 1976


  Loading...