default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert E. Woodrow
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j28]Claude Laflamme, Maurice Pouzet, Norbert Sauer, Robert E. Woodrow:
Siblings of an ℵ0-categorical relational structure. Contributions Discret. Math. 16(2): 90-127 (2021)- [j27]Andrés Aranda
, Claude Laflamme, Dániel T. Soukup, Robert E. Woodrow:
A universal partition result for infinite homogeneous Kn-free and related graphs. Discret. Math. 344(1): 112153 (2021) - [j26]Claude Laflamme, Maurice Pouzet, Norbert Sauer, Robert E. Woodrow:
The Poset of Copies for Automorphism Groups of Countable Relational Structures. J. Multiple Valued Log. Soft Comput. 36(4-5): 353-381 (2021) - 2019
- [j25]Claude Laflamme, Andrés Aranda, Dániel T. Soukup, Robert E. Woodrow:
Balanced independent sets in graphs omitting large cliques. J. Comb. Theory B 137: 1-9 (2019) - [j24]Pierre Ille, Robert E. Woodrow:
Fractal graphs. J. Graph Theory 91(1): 53-72 (2019) - 2017
- [j23]Claude Laflamme, Maurice Pouzet, Robert E. Woodrow:
Equimorphy: the case of chains. Arch. Math. Log. 56(7-8): 811-829 (2017) - [j22]Houmem Belkhechine, Pierre Ille, Robert E. Woodrow:
Criticality of switching classes of reversible 2-structures labeled by an Abelian group. Discuss. Math. Graph Theory 37(1): 175-209 (2017) - 2014
- [j21]Jakub Jasinski, Claude Laflamme, Lionel Nguyen Van Thé, Robert E. Woodrow:
Ramsey Precompact Expansions of Homogeneous Directed Graphs. Electron. J. Comb. 21(4): 4 (2014) - 2013
- [j20]Dwight Duffus, Claude Laflamme, Maurice Pouzet, Robert E. Woodrow:
Convex sublattices of a lattice and a fixed point property. Contributions Discret. Math. 8(1) (2013) - [j19]Imants Baruss, Robert E. Woodrow:
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 7(3): 323-334 (2013) - 2011
- [j18]Pierre Ille, Robert E. Woodrow:
Decomposition tree of a lexicographic product of binary structures. Discret. Math. 311(21): 2346-2358 (2011) - 2009
- [j17]Pierre Ille, Robert E. Woodrow:
Weakly partitive families on infinite sets. Contributions Discret. Math. 4(1) (2009) - 2005
- [j16]Peter C. Gibson, Maurice Pouzet, Robert E. Woodrow:
Relational structures having finitely many full-cardinality restrictions. Discret. Math. 291(1-3): 115-134 (2005) - 2004
- [j15]Gena Hahn, Pierre Ille, Robert E. Woodrow:
Absorbing sets in arc-coloured tournaments. Discret. Math. 283(1-3): 93-99 (2004) - 2002
- [j14]Gena Hahn, François Laviolette, Norbert Sauer, Robert E. Woodrow:
On cop-win graphs. Discret. Math. 258(1-3): 27-41 (2002) - 1997
- [j13]Norbert Sauer, Robert E. Woodrow, Vojtech Rödl:
Chromatic Ramsey Theory. Eur. J. Comb. 18(1): 93-102 (1997) - 1992
- [j12]H. D. Macpherson, Maurice Pouzet, Robert E. Woodrow:
Countable Structures of Given Age. J. Symb. Log. 57(3): 992-1010 (1992) - 1991
- [j11]Gena Hahn, Eric C. Milner, Robert E. Woodrow:
Infinite friendship graphs with infinite parameters. J. Comb. Theory B 52(1): 30-41 (1991) - [j10]Dwight Duffus, Bill Sands, Norbert Sauer, Robert E. Woodrow:
Two-colouring all two-element maximal antichains. J. Comb. Theory A 57(1): 109-116 (1991) - 1990
- [j9]Jason I. Brown, David Kelly, Johanan Schönheim, Robert E. Woodrow:
Graph coloring satisfying restraints. Discret. Math. 80(2): 123-143 (1990) - 1989
- [j8]Eric C. Milner, Robert E. Woodrow:
On directed graphs with an independent covering set. Graphs Comb. 5(1): 363-369 (1989) - 1985
- [j7]Dwight Duffus, Bill Sands, Robert E. Woodrow:
On the chromatic number of the product of graphs. J. Graph Theory 9(4): 487-495 (1985) - 1983
- [j6]Robert E. Woodrow, Julia F. Knight:
A Complete Theory with Arbitrarily Large Minimality Ranks. J. Symb. Log. 48(2): 321-328 (1983) - 1982
- [j5]Bill Sands, Norbert Sauer, Robert E. Woodrow:
On monochromatic paths in edge-coloured digraphs. J. Comb. Theory B 33(3): 271-275 (1982) - 1981
- [j4]Bruce I. Rose, Robert E. Woodrow:
Ultrahomogeneous Structures. Math. Log. Q. 27(2-6): 23-30 (1981) - 1979
- [j3]Robert E. Woodrow:
There are four countable ultrahomogeneous graphs without triangles. J. Comb. Theory B 27(2): 168-179 (1979) - 1978
- [j2]Robert E. Woodrow:
Theories with a Finite Number of Countable Models. J. Symb. Log. 43(3): 442-455 (1978) - 1976
- [j1]Robert E. Woodrow:
A Note on Countable Complete Theories Having Three Isomorphism Types of Countable Models. J. Symb. Log. 41(3): 672-680 (1976)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
