Robin Thomas - RankMe

131 papers A* 7A 1B 1Journal 119Unranked 2

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations. J. Comb. Theory B Zdenek Dvorák, Daniel Král', Robin Thomas
2023	J	`jnl`	On 2-cycles of graphs. J. Comb. Theory B Sergey Norin, Robin Thomas, Hein van der Holst
2023	J	`jnl`	Packing J. Comb. Theory B Robin Thomas, Youngho Yoo
2023	J	`jnl`	Packing cycles in undirected group-labelled graphs. J. Comb. Theory B Robin Thomas, Youngho Yoo
2023	J	`jnl`	Properties of 8-contraction-critical graphs with no K7 minor. Eur. J. Comb. Martin Rolek, Zi-Xia Song, Robin Thomas
2022	J	`jnl`	Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm. J. Comb. Theory B Zdenek Dvorák, Daniel Král', Robin Thomas
2021	J	`jnl`	Three-coloring triangle-free graphs on surfaces IV. Bounding face sizes of 4-critical graphs. J. Comb. Theory B Zdenek Dvorák, Daniel Král', Robin Thomas
2021	J	`jnl`	Three-coloring triangle-free graphs on surfaces V. Coloring planar graphs with distant anomalies. J. Comb. Theory B Zdenek Dvorák, Daniel Král', Robin Thomas
2020	J	`jnl`	Quickly excluding a non-planar graph. CoRR Ken-ichi Kawarabayashi, Robin Thomas, Paul Wollan
2020	J	`jnl`	Three-coloring triangle-free graphs on surfaces III. Graphs of girth five. J. Comb. Theory B Zdenek Dvorák, Daniel Král', Robin Thomas
2019	J	`jnl`	Excluded minors in cubic graphs. J. Comb. Theory B Neil Robertson, Paul D. Seymour, Robin Thomas
2019	J	`jnl`	Excluding subdivisions of bounded degree graphs. J. Comb. Theory B Chun-Hung Liu, Robin Thomas
2019	J	`jnl`	Girth Six Cubic Graphs Have Petersen Minors. Comb. Neil Robertson, Paul D. Seymour, Robin Thomas
2019	J	`jnl`	Minimal bricks. CoRR Serguei Norine, Robin Thomas
2019	J	`jnl`	The Extremal Function for Bipartite Linklessly Embeddable Graphs. Comb. Rose McCarty, Robin Thomas
2019	J	`jnl`	The extremal functions for triangle-free graphs with excluded minors. Eur. J. Comb. Robin Thomas, Youngho Yoo
2018	J	`jnl`	A new proof of the flat wall theorem. J. Comb. Theory B Ken-ichi Kawarabayashi, Robin Thomas, Paul Wollan
2018	J	`jnl`	Five-list-coloring graphs on surfaces III. One list of size one and one list of size two. J. Comb. Theory B Luke Postle, Robin Thomas
2018	J	`jnl`	Four Edge-Independent Spanning Trees. SIAM J. Discret. Math. Alexander Hoyer, Robin Thomas
2018	J	`jnl`	Non-embeddable extensions of embedded minors. J. Comb. Theory B Rajneesh Hegde, Robin Thomas
2018	J	`jnl`	Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk. J. Comb. Theory B Zdenek Dvorák, Daniel Král', Robin Thomas
2017	J	`jnl`	Cyclically five-connected cubic graphs. J. Comb. Theory B Neil Robertson, Paul D. Seymour, Robin Thomas
2017	J	`jnl`	Minors of two-connected graphs of large path-width. CoRR Thanh N. Dang, Robin Thomas
2016	J	`jnl`	Deploying Robots With Two Sensors in J. Graph Theory Waseem Abbas, Magnus Egerstedt, Chun-Hung Liu, Robin Thomas, Peter Whalen
2016	J	`jnl`	Five-list-coloring graphs on surfaces II. A linear bound for critical graphs in a disk. J. Comb. Theory B Luke Postle, Robin Thomas
2016	J	`jnl`	Hyperbolic families and coloring graphs on surfaces. CoRR Luke Postle, Robin Thomas
2016	J	`jnl`	Non-planar extensions of subdivisions of planar graphs. J. Comb. Theory B Sergey Norin, Robin Thomas
2016	J	`jnl`	Odd K J. Comb. Theory B Robin Thomas, Peter Whalen
2016	J	`jnl`	Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle. J. Comb. Theory B Zdenek Dvorák, Daniel Král', Robin Thomas
2016	J	`jnl`	Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm. CoRR Zdenek Dvorák, Daniel Král, Robin Thomas
2016	J	`jnl`	Three-edge-colouring doublecross cubic graphs. J. Comb. Theory B Katherine Edwards, Daniel P. Sanders, Paul D. Seymour, Robin Thomas
2015	J	`jnl`	Cyclically five-connected cubic graphs. CoRR Neil Robertson, Paul D. Seymour, Robin Thomas
2015	J	`jnl`	Excluding A Grid Minor In Planar Digraphs. CoRR Thor Johnson, Neil Robertson, Paul D. Seymour, Robin Thomas
2015	J	`jnl`	Five-list-coloring graphs on surfaces I. Two lists of size two in planar graphs. J. Comb. Theory B Luke Postle, Robin Thomas
2015	J	`jnl`	Five-list-coloring graphs on surfaces II. A linear bound for critical graphs in a disk. CoRR Luke Postle, Robin Thomas
2015	J	`jnl`	Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations. CoRR Zdenek Dvorák, Daniel Král, Robin Thomas
2014	J	`jnl`	Discharging cartwheels. CoRR Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas
2014	J	`jnl`	Five-list-coloring graphs on surfaces I. Two lists of size two in planar graphs. CoRR Luke Postle, Robin Thomas
2014	J	`jnl`	Girth six cubic graphs have Petersen minors. CoRR Neil Robertson, Paul D. Seymour, Robin Thomas
2014	J	`jnl`	List-coloring apex-minor-free graphs. CoRR Zdenek Dvorák, Robin Thomas
2014	J	`jnl`	Non-Embeddable Extensions of Embedded Minors. CoRR Rajneesh Hegde, Robin Thomas
2014	J	`jnl`	Reducibility in the Four-Color Theorem. CoRR Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas
2013	—	`ch.`	Arrangeability and Clique Subdivisions. The Mathematics of Paul Erdős II Vojtech Rödl, Robin Thomas
2013	J	`jnl`	Odd K_3, 3 subdivisions in bipartite graphs. CoRR Robin Thomas, Peter Whalen
2013	J	`jnl`	Sub-exponentially many 3-colorings of triangle-free planar graphs. J. Comb. Theory B Arash Asadi, Zdenek Dvorák, Luke Postle, Robin Thomas
2013	J	`jnl`	Testing first-order properties for subclasses of sparse graphs. J. ACM Zdenek Dvorák, Daniel Král, Robin Thomas
2013	J	`jnl`	Three-coloring triangle-free graphs on surfaces II. 4-critical graphs in a disk CoRR Zdenek Dvorák, Daniel Král, Robin Thomas
2013	J	`jnl`	Three-coloring triangle-free planar graphs in linear time CoRR Zdenek Dvorák, Ken-ichi Kawarabayashi, Robin Thomas
2012	J	`jnl`	Five-coloring graphs on the Klein bottle. J. Comb. Theory B Nathan Chenette, Luke Postle, Noah Streib, Robin Thomas, Carl Yerger
2012	J	`jnl`	K_6 minors in 6-connected graphs of bounded tree-width CoRR Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan
2012	J	`jnl`	K_6 minors in large 6-connected graphs CoRR Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan
2012	J	`jnl`	Nested cycles in large triangulations and crossing-critical graphs. J. Comb. Theory B César Hernández-Vélez, Gelasio Salazar, Robin Thomas
2011	J	`jnl`	Edge-coloring series-parallel multigraphs CoRR Cristina G. Fernandes, Robin Thomas
2011	J	`jnl`	Large non-planar graphs and an application to crossing-critical graphs. J. Comb. Theory B Guoli Ding, Bogdan Oporowski, Robin Thomas, Dirk Vertigan
2011	J	`jnl`	Minor-Minimal Planar Graphs of Even Branch-Width. Comb. Probab. Comput. Torsten Inkmann, Robin Thomas
2011	J	`jnl`	Minor-minimal non-projective planar graphs with an internal 3-separation. Electron. Notes Discret. Math. Arash Asadi, Luke Postle, Robin Thomas
2011	J	`jnl`	Packing directed circuits exactly. Comb. Bertrand Guenin, Robin Thomas
2011	J	`jnl`	Testing first-order properties for subclasses of sparse graphs CoRR Zdenek Dvorák, Daniel Král, Robin Thomas
2011	J	`jnl`	Three-coloring triangle-free planar graphs in linear time. ACM Trans. Algorithms Zdenek Dvorák, Ken-ichi Kawarabayashi, Robin Thomas
2010	A*	`conf`	Deciding First-Order Properties for Sparse Graphs. FOCS Zdenek Dvorák, Daniel Král, Robin Thomas
2010	J	`jnl`	K J. Comb. Theory B Maria Chudnovsky, Neil Robertson, Paul D. Seymour, Robin Thomas
2010	J	`jnl`	Packing directed circuits exactly CoRR Bertrand Guenin, Robin Thomas
2010	J	`jnl`	Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle CoRR Zdenek Dvorák, Daniel Král, Robin Thomas
2010	J	`jnl`	Voting in Agreeable Societies. Am. Math. Mon. Deborah E. Berg, Serguei Norine, Francis Edward Su, Robin Thomas, Paul Wollan
2009	A*	`conf`	Coloring triangle-free graphs on surfaces. SODA Zdenek Dvorák, Daniel Král, Robin Thomas
2009	J	`jnl`	Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs. Electron. Notes Discret. Math. Arash Asadi, Luke Postle, Robin Thomas
2009	A*	`conf`	Three-coloring triangle-free planar graphs in linear time. SODA Zdenek Dvorák, Ken-ichi Kawarabayashi, Robin Thomas
2008	J	`jnl`	Coloring even-faced graphs in the torus and the Klein bottle. Comb. Daniel Král, Robin Thomas
2008	J	`jnl`	Minimally non-Pfaffian graphs. J. Comb. Theory B Serguei Norine, Robin Thomas
2008	J	`jnl`	Pfaffian labelings and signs of edge colorings. Comb. Serguei Norine, Robin Thomas
2008	J	`jnl`	Six-Critical Graphs on the Klein Bottle. Electron. Notes Discret. Math. Nathan Chenette, Luke Postle, Noah Streib, Robin Thomas, Carl Yerger, Ken-ichi Kawarabayashi, Daniel Král, Jan Kyncl, Bernard Lidický
2008	J	`jnl`	The extremal function for 3-linked graphs. J. Comb. Theory B Robin Thomas, Paul Wollan
2007	B	`conf`	Coloring Triangle-Free Graphs on Surfaces. ISAAC Zdenek Dvorák, Daniel Král, Robin Thomas
2007	J	`jnl`	Generating bricks. J. Comb. Theory B Serguei Norine, Robin Thomas
2006	J	`jnl`	Independent sets in triangle-free cubic planar graphs. J. Comb. Theory B Christopher Carl Heckman, Robin Thomas
2006	J	`jnl`	Minimal bricks. J. Comb. Theory B Serguei Norine, Robin Thomas
2006	J	`jnl`	Proper minor-closed families are small. J. Comb. Theory B Serguei Norine, Paul D. Seymour, Robin Thomas, Paul Wollan
2006	J	`jnl`	The Circular Chromatic Index of Flower Snarks. Electron. J. Comb. Mohammad Ghebleh, Daniel Král, Serguei Norine, Robin Thomas
2006	J	`jnl`	The extremal function for J. Comb. Theory B Zi-Xia Song, Robin Thomas
2005	J	`jnl`	An improved linear edge bound for graph linkages. Eur. J. Comb. Robin Thomas, Paul Wollan
2005	J	`jnl`	Generation of simple quadrangulations of the sphere. Discret. Math. Gunnar Brinkmann, Sam Greenberg, Catherine S. Greenhill, Brendan D. McKay, Robin Thomas, Paul Wollan
2005	J	`jnl`	Hamilton paths in toroidal graphs. J. Comb. Theory B Robin Thomas, Xingxing Yu, Wenan Zang
2004	J	`jnl`	On possible counterexamples to Negami's planar cover conjecture. J. Graph Theory Petr Hlinený, Robin Thomas
2004	J	`jnl`	Three-coloring Klein bottle graphs of girth five. J. Comb. Theory B Robin Thomas, Barrett Walls
2003	J	`jnl`	Progress on perfect graphs. Math. Program. Maria Chudnovsky, Neil Robertson, Paul D. Seymour, Robin Thomas
2003	J	`jnl`	Temperely-Lieb Algebras and the Four-Color Theorem. Comb. Louis H. Kauffman, Robin Thomas
2002	J	`jnl`	Generating Internally Four-Connected Graphs. J. Comb. Theory B Thor Johnson, Robin Thomas
2001	J	`jnl`	A new proof of the independence ratio of triangle-free cubic graphs. Discret. Math. Christopher Carl Heckman, Robin Thomas
2001	J	`jnl`	Directed Tree-Width. J. Comb. Theory B Thor Johnson, Neil Robertson, Paul D. Seymour, Robin Thomas
2001	J	`jnl`	Large induced forests in sparse graphs. J. Graph Theory Noga Alon, Dhruv Mubayi, Robin Thomas
2000	J	`jnl`	Clique Minors in Graphs and Their Complements. J. Comb. Theory B Bruce A. Reed, Robin Thomas
2000	A*	`conf`	Digraph minors and algorithms (abstract only). SODA Robin Thomas
2000	J	`jnl`	Excluding Minors In Nonplanar Graphs Of Girth At Least Five. Comb. Probab. Comput. Robin Thomas, Jan Mcdonald Thomson
1999	J	`jnl`	Excluding a Countable Clique. J. Comb. Theory B Reinhard Diestel, Robin Thomas
1999	A	`conf`	Graph Planarity and Related Topics. GD Robin Thomas
1999	J	`jnl`	List Edge-Colorings of Series-Parallel Graphs. Electron. J. Comb. Martin Juvan, Bojan Mohar, Robin Thomas
1997	J	`jnl`	Five-Connected Toroidal Graphs Are Hamiltonian. J. Comb. Theory B Robin Thomas, Xingxing Yu
1997	A*	`conf`	Permanents, Pfaffian Orientations, and Even Directed Circuits (Extended Abstract). STOC William McCuaig, Neil Robertson, Paul D. Seymour, Robin Thomas
1997	J	`jnl`	The Four-Colour Theorem. J. Comb. Theory B Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas
1997	J	`jnl`	Tutte's Edge-Colouring Conjecture. J. Comb. Theory B Neil Robertson, Paul D. Seymour, Robin Thomas
1996	A*	`conf`	Efficiently Four-Coloring Planar Graphs. STOC Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas
1996	J	`jnl`	Packing Directed Circuits. Comb. Bruce A. Reed, Neil Robertson, Paul D. Seymour, Robin Thomas
1996	J	`jnl`	Spanning paths in infinite planar graphs. J. Graph Theory Nathaniel Dean, Robin Thomas, Xingxing Yu
1996	J	`jnl`	Uniqueness of highly representative surface embeddings. J. Graph Theory Paul D. Seymour, Robin Thomas
1995	J	`jnl`	Kuratowski Chains. J. Comb. Theory B Neil Robertson, Paul D. Seymour, Robin Thomas
1995	J	`jnl`	On the Genus of a Random Graph. Random Struct. Algorithms Vojtech Rödl, Robin Thomas
1995	J	`jnl`	Petersen Family Minors. J. Comb. Theory B Neil Robertson, Paul D. Seymour, Robin Thomas
1995	J	`jnl`	Sachs' Linkless Embedding Conjecture. J. Comb. Theory B Neil Robertson, Paul D. Seymour, Robin Thomas
1994	J	`jnl`	4-Connected Projective-Planar Graphs Are Hamiltonian. J. Comb. Theory B Robin Thomas, Xingxing Yu
1994	J	`jnl`	Call Routing and the Ratcatcher. Comb. Paul D. Seymour, Robin Thomas
1994	J	`jnl`	Planar Separators. SIAM J. Discret. Math. Noga Alon, Paul D. Seymour, Robin Thomas
1994	J	`jnl`	Quickly Excluding a Planar Graph. J. Comb. Theory B Neil Robertson, Paul D. Seymour, Robin Thomas
1993	J	`jnl`	Graph Searching and a Min-Max Theorem for Tree-Width. J. Comb. Theory B Paul D. Seymour, Robin Thomas
1993	J	`jnl`	Hadwiger's conjecture for K Comb. Neil Robertson, Paul D. Seymour, Robin Thomas
1993	J	`jnl`	Typical Subgraphs of 3- and 4-Connected Graphs. J. Comb. Theory B Bogdan Oporowski, James G. Oxley, Robin Thomas
1992	J	`jnl`	Monochromatic Vs multicolored paths. Graphs Comb. Hanno Lefmann, Vojtech Rödl, Robin Thomas
1992	J	`jnl`	On the complexity of finding iso- and other morphisms for partial k-trees. Discret. Math. Jirí Matousek, Robin Thomas
1991	—	`conf`	A survey of linkless embeddings. Graph Structure Theory Neil Robertson, Paul D. Seymour, Robin Thomas
1991	J	`jnl`	Algorithms Finding Tree-Decompositions of Graphs. J. Algorithms Jirí Matousek, Robin Thomas
1991	J	`jnl`	An end-faithful spanning tree counterexample. Discret. Math. Paul D. Seymour, Robin Thomas
1991	J	`jnl`	Analyzing Nash-Williams' partition theorem by means of ordinal types. Discret. Math. Igor Kríz, Robin Thomas
1991	J	`jnl`	Excluding infinite minors. Discret. Math. Neil Robertson, Paul D. Seymour, Robin Thomas
1991	J	`jnl`	On the orientable genus of graphs embedded in the klein bottle. J. Graph Theory Neil Robertson, Robin Thomas
1991	J	`jnl`	Quickly excluding a forest. J. Comb. Theory B Daniel Bienstock, Neil Robertson, Paul D. Seymour, Robin Thomas
1991	—	`conf`	Structural descriptions of lower ideals of trees. Graph Structure Theory Neil Robertson, Paul D. Seymour, Robin Thomas
1991	J	`jnl`	The menger-like property of the tree-width of infinite graphs. J. Comb. Theory B Igor Kríz, Robin Thomas
1990	A*	`conf`	A Separator Theorem for Graphs with an Excluded Minor and its Applications STOC Noga Alon, Paul D. Seymour, Robin Thomas
1990	J	`jnl`	A menger-like property of tree-width: The finite case. J. Comb. Theory B Robin Thomas
1990	J	`jnl`	Clique-sums, tree-decompositions and compactness. Discret. Math. Igor Kríz, Robin Thomas
1990	J	`jnl`	On well-quasi-ordering finite structures with labels. Graphs Comb. Igor Kríz, Robin Thomas
1985	J	`jnl`	Graphs without J. Comb. Theory B Robin Thomas