Robin Thomas 0001

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Igor Kríz

> Home > Persons > Robin Thomas 0001

Publications

1991
[j11]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/KrizT91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/KrizT91
Igor Kríz, Robin Thomas:
Analyzing Nash-Williams' partition theorem by means of ordinal types. Discret. Math. 95(1-3): 135-167 (1991)
[j7]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jct/KrizT91
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/KrizT91
Igor Kríz, Robin Thomas:
The menger-like property of the tree-width of infinite graphs. J. Comb. Theory, Ser. B 52(1): 86-91 (1991)
1990
[j4]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/KrizT90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/KrizT90
Igor Kríz, Robin Thomas:
Clique-sums, tree-decompositions and compactness. Discret. Math. 81(2): 177-185 (1990)
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/gc/KrizT90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/gc/KrizT90
Igor Kríz, Robin Thomas:
On well-quasi-ordering finite structures with labels. Graphs Comb. 6(1): 41-49 (1990)

a service of

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.