The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Robin Thomas: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  51. Coloring Triangle-Free Graphs on Surfaces. [Citation Graph (, )][DBLP]


  52. Coloring triangle-free graphs on surfaces. [Citation Graph (, )][DBLP]


  53. Three-coloring triangle-free planar graphs in linear time. [Citation Graph (, )][DBLP]


  54. Kt Minors in Large t-Connected Graphs. [Citation Graph (, )][DBLP]


  55. Pfaffian labelings and signs of edge colorings. [Citation Graph (, )][DBLP]


  56. Coloring even-faced graphs in the torus and the Klein bottle. [Citation Graph (, )][DBLP]


  57. The Circular Chromatic Index of Flower Snarks. [Citation Graph (, )][DBLP]


Search in 0.083secs, Finished in 0.086secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002