2009 | ||
---|---|---|
59 | EE | Zdenek Dvorak, Ken-ichi Kawarabayashi, Robin Thomas: Three-coloring triangle-free planar graphs in linear time. SODA 2009: 1176-1182 |
58 | EE | Zdenek Dvorak, Daniel Král, Robin Thomas: Coloring triangle-free graphs on surfaces. SODA 2009: 120-129 |
2008 | ||
57 | EE | Serguei Norine, Robin Thomas: Pfaffian labelings and signs of edge colorings. Combinatorica 28(1): 99-111 (2008) |
56 | EE | Daniel Král, Robin Thomas: Coloring even-faced graphs in the torus and the Klein bottle. Combinatorica 28(3): 325-341 (2008) |
55 | EE | Nathan Chenette, Luke Postle, Noah Streib, Robin Thomas, Carl Yerger, Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický: Six-Critical Graphs on the Klein Bottle. Electronic Notes in Discrete Mathematics 31: 235-240 (2008) |
54 | EE | Serguei Norine, Robin Thomas: Minimally non-Pfaffian graphs. J. Comb. Theory, Ser. B 98(5): 1038-1055 (2008) |
53 | EE | Robin Thomas, Paul Wollan: The extremal function for 3-linked graphs. J. Comb. Theory, Ser. B 98(5): 939-971 (2008) |
2007 | ||
52 | EE | Zdenek Dvorak, Daniel Král, Robin Thomas: Coloring Triangle-Free Graphs on Surfaces. ISAAC 2007: 2-4 |
51 | EE | Serguei Norine, Robin Thomas: Generating bricks. J. Comb. Theory, Ser. B 97(5): 769-817 (2007) |
2006 | ||
50 | EE | Mohammad Ghebleh, Daniel Král, Serguei Norine, Robin Thomas: The Circular Chromatic Index of Flower Snarks. Electr. J. Comb. 13(1): (2006) |
49 | EE | Zi-Xia Song, Robin Thomas: The extremal function for K9 minors. J. Comb. Theory, Ser. B 96(2): 240-252 (2006) |
48 | EE | Christopher Carl Heckman, Robin Thomas: Independent sets in triangle-free cubic planar graphs. J. Comb. Theory, Ser. B 96(2): 253-275 (2006) |
47 | EE | Serguei Norine, Robin Thomas: Minimal bricks. J. Comb. Theory, Ser. B 96(4): 505-513 (2006) |
46 | EE | Serguei Norine, Paul D. Seymour, Robin Thomas, Paul Wollan: Proper minor-closed families are small. J. Comb. Theory, Ser. B 96(5): 754-757 (2006) |
2005 | ||
45 | EE | Gunnar Brinkmann, Sam Greenberg, Catherine S. Greenhill, Brendan D. McKay, Robin Thomas, Paul Wollan: Generation of simple quadrangulations of the sphere. Discrete Mathematics 305(1-3): 33-54 (2005) |
44 | EE | Robin Thomas, Paul Wollan: An improved linear edge bound for graph linkages. Eur. J. Comb. 26(3-4): 309-324 (2005) |
43 | EE | Robin Thomas, Xingxing Yu, Wenan Zang: Hamilton paths in toroidal graphs. J. Comb. Theory, Ser. B 94(2): 214-236 (2005) |
2004 | ||
42 | EE | Robin Thomas, Barrett Walls: Three-coloring Klein bottle graphs of girth five. J. Comb. Theory, Ser. B 92(1): 115-135 (2004) |
41 | EE | Petr Hlinený, Robin Thomas: On possible counterexamples to Negami's planar cover conjecture. Journal of Graph Theory 46(3): 183-206 (2004) |
2003 | ||
40 | EE | Louis Kauffman, Robin Thomas: Temperely-Lieb Algebras and the Four-Color Theorem. Combinatorica 23(4): 653-667 (2003) |
2002 | ||
39 | EE | Thor Johnson, Robin Thomas: Generating Internally Four-Connected Graphs. J. Comb. Theory, Ser. B 85(1): 21-58 (2002) |
2001 | ||
38 | EE | Christopher Carl Heckman, Robin Thomas: A new proof of the independence ratio of triangle-free cubic graphs. Discrete Mathematics 233(1-3): 233-237 (2001) |
37 | EE | Thor Johnson, Neil Robertson, Paul D. Seymour, Robin Thomas: Directed Tree-Width. J. Comb. Theory, Ser. B 82(1): 138-154 (2001) |
2000 | ||
36 | EE | Robin Thomas: Digraph minors and algorithms (abstract only). SODA 2000: 75 |
35 | Robin Thomas, Jan Mcdonald Thomson: Excluding Minors In Nonplanar Graphs Of Girth At Least Five. Combinatorics, Probability & Computing 9(6): (2000) | |
34 | EE | Bruce A. Reed, Robin Thomas: Clique Minors in Graphs and Their Complements. J. Comb. Theory, Ser. B 78(1): 81-85 (2000) |
1999 | ||
33 | EE | Robin Thomas: Graph Planarity and Related Topics. Graph Drawing 1999: 137-144 |
32 | EE | Martin Juvan, Bojan Mohar, Robin Thomas: List Edge-Colorings of Series-Parallel Graphs. Electr. J. Comb. 6: (1999) |
31 | EE | Reinhard Diestel, Robin Thomas: Excluding a Countable Clique. J. Comb. Theory, Ser. B 76(1): 41-67 (1999) |
1997 | ||
30 | EE | William McCuaig, Neil Robertson, Paul D. Seymour, Robin Thomas: Permanents, Pfaffian Orientations, and Even Directed Circuits (Extended Abstract). STOC 1997: 402-405 |
29 | EE | Robin Thomas, Xingxing Yu: Five-Connected Toroidal Graphs Are Hamiltonian. J. Comb. Theory, Ser. B 69(1): 79-96 (1997) |
28 | EE | Neil Robertson, Paul D. Seymour, Robin Thomas: Tutte's Edge-Colouring Conjecture. J. Comb. Theory, Ser. B 70(1): 166-183 (1997) |
27 | EE | Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas: The Four-Colour Theorem. J. Comb. Theory, Ser. B 70(1): 2-44 (1997) |
1996 | ||
26 | EE | Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas: Efficiently Four-Coloring Planar Graphs. STOC 1996: 571-575 |
25 | Bruce A. Reed, Neil Robertson, Paul D. Seymour, Robin Thomas: Packing Directed Circuits. Combinatorica 16(4): 535-554 (1996) | |
1995 | ||
24 | EE | Neil Robertson, Paul D. Seymour, Robin Thomas: Kuratowski Chains. J. Comb. Theory, Ser. B 64(2): 127-154 (1995) |
23 | EE | Neil Robertson, Paul D. Seymour, Robin Thomas: Petersen Family Minors. J. Comb. Theory, Ser. B 64(2): 155-184 (1995) |
22 | EE | Neil Robertson, Paul D. Seymour, Robin Thomas: Sachs' Linkless Embedding Conjecture. J. Comb. Theory, Ser. B 64(2): 185-227 (1995) |
21 | Vojtech Rödl, Robin Thomas: On the Genus of a Random Graph. Random Struct. Algorithms 6(1): 1-12 (1995) | |
1994 | ||
20 | Paul D. Seymour, Robin Thomas: Call Routing and the Ratcatcher. Combinatorica 14(2): 217-241 (1994) | |
19 | EE | Robin Thomas, Xingxing Yu: 4-Connected Projective-Planar Graphs Are Hamiltonian. J. Comb. Theory, Ser. B 62(1): 114-132 (1994) |
18 | EE | Neil Robertson, Paul D. Seymour, Robin Thomas: Quickly Excluding a Planar Graph. J. Comb. Theory, Ser. B 62(2): 323-348 (1994) |
17 | EE | Noga Alon, Paul D. Seymour, Robin Thomas: Planar Separators. SIAM J. Discrete Math. 7(2): 184-193 (1994) |
1993 | ||
16 | Neil Robertson, Paul D. Seymour, Robin Thomas: Hadwiger's conjecture for K 6-free graphs. Combinatorica 13(3): 279-361 (1993) | |
15 | EE | Bogdan Oporowski, James G. Oxley, Robin Thomas: Typical Subgraphs of 3- and 4-Connected Graphs. J. Comb. Theory, Ser. B 57(2): 239-257 (1993) |
14 | EE | Paul D. Seymour, Robin Thomas: Graph Searching and a Min-Max Theorem for Tree-Width. J. Comb. Theory, Ser. B 58(1): 22-33 (1993) |
1992 | ||
13 | EE | Jirí Matousek, Robin Thomas: On the complexity of finding iso- and other morphisms for partial k-trees. Discrete Mathematics 108(1-3): 343-364 (1992) |
1991 | ||
12 | Neil Robertson, Paul D. Seymour, Robin Thomas: A survey of linkless embeddings. Graph Structure Theory 1991: 125-136 | |
11 | Neil Robertson, Paul D. Seymour, Robin Thomas: Structural descriptions of lower ideals of trees. Graph Structure Theory 1991: 525-538 | |
10 | EE | Igor Kríz, Robin Thomas: Analyzing Nash-Williams' partition theorem by means of ordinal types. Discrete Mathematics 95(1-3): 135-167 (1991) |
9 | EE | Neil Robertson, Paul D. Seymour, Robin Thomas: Excluding infinite minors. Discrete Mathematics 95(1-3): 303-319 (1991) |
8 | EE | Paul D. Seymour, Robin Thomas: An end-faithful spanning tree counterexample. Discrete Mathematics 95(1-3): 321-330 (1991) |
7 | Jirí Matousek, Robin Thomas: Algorithms Finding Tree-Decompositions of Graphs. J. Algorithms 12(1): 1-22 (1991) | |
6 | EE | 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) |
5 | EE | Daniel Bienstock, Neil Robertson, Paul D. Seymour, Robin Thomas: Quickly excluding a forest. J. Comb. Theory, Ser. B 52(2): 274-283 (1991) |
1990 | ||
4 | Noga Alon, Paul D. Seymour, Robin Thomas: A Separator Theorem for Graphs with an Excluded Minor and its Applications STOC 1990: 293-299 | |
3 | EE | Igor Kríz, Robin Thomas: Clique-sums, tree-decompositions and compactness. Discrete Mathematics 81(2): 177-185 (1990) |
2 | EE | Robin Thomas: A menger-like property of tree-width: The finite case. J. Comb. Theory, Ser. B 48(1): 67-76 (1990) |
1985 | ||
1 | EE | Robin Thomas: Graphs without K4 and well-quasi-ordering. J. Comb. Theory, Ser. B 38(3): 240-247 (1985) |