|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 4 occurrences of 3 keywords
|
|
|
|
|
Results
Found 78 publication records. Showing 78 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | César Hernández-Vélez, Gelasio Salazar, Robin Thomas |
Nested cycles in large triangulations and crossing-critical graphs.  |
J. Comb. Theory, Ser. B  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan |
K_6 minors in large 6-connected graphs |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas, Paul Wollan |
K_6 minors in 6-connected graphs of bounded tree-width |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Guoli Ding, Bogdan Oporowski, Robin Thomas, Dirk Vertigan |
Large non-planar graphs and an application to crossing-critical graphs. |
J. Comb. Theory, Ser. B |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Arash Asadi, Luke Postle, Robin Thomas |
Minor-minimal non-projective planar graphs with an internal 3-separation. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Torsten Inkmann, Robin Thomas |
Minor-Minimal Planar Graphs of Even Branch-Width. |
Combinatorics, Probability & Computing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zdenek Dvorak, Ken-ichi Kawarabayashi, Robin Thomas |
Three-coloring triangle-free planar graphs in linear time. |
ACM Transactions on Algorithms |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bertrand Guenin, Robin Thomas |
Packing directed circuits exactly. |
Combinatorica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zdenek Dvorak, Daniel Král, Robin Thomas |
Testing first-order properties for subclasses of sparse graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Cristina G. Fernandes, Robin Thomas |
Edge-coloring series-parallel multigraphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Maria Chudnovsky, Neil Robertson, Paul D. Seymour, Robin Thomas |
K4-free graphs with no odd holes. |
J. Comb. Theory, Ser. B |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bertrand Guenin, Robin Thomas |
Packing directed circuits exactly |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Zdenek Dvorak, Daniel Král, Robin Thomas |
Three-coloring triangle-free graphs on surfaces I. Extending a coloring to a disk with one triangle |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Zdenek Dvorak, Daniel Král, Robin Thomas |
Deciding First-Order Properties for Sparse Graphs. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Arash Asadi, Luke Postle, Robin Thomas |
Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs. |
Electronic Notes in Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zdenek Dvorak, Ken-ichi Kawarabayashi, Robin Thomas |
Three-coloring triangle-free planar graphs in linear time. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zdenek Dvorak, Daniel Král, Robin Thomas |
Coloring triangle-free graphs on surfaces. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Robin Thomas |
Kt Minors in Large t-Connected Graphs. |
IWOCA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Robin Thomas, Paul Wollan |
The extremal function for 3-linked graphs. |
J. Comb. Theory, Ser. B |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Serguei Norine, Robin Thomas |
Minimally non-Pfaffian graphs. |
J. Comb. Theory, Ser. B |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Král, Robin Thomas |
Coloring even-faced graphs in the torus and the Klein bottle. |
Combinatorica |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 05C15, 05C10 |
| 1 | Serguei Norine, Robin Thomas |
Pfaffian labelings and signs of edge colorings. |
Combinatorica |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 05C70, 05C15, 05C75, 05C10 |
| 1 | Serguei Norine, Robin Thomas |
Generating bricks. |
J. Comb. Theory, Ser. B |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Zdenek Dvorak, Daniel Král, Robin Thomas |
Coloring Triangle-Free Graphs on Surfaces. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Serguei Norine, Robin Thomas |
Minimal bricks. |
J. Comb. Theory, Ser. B |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christopher Carl Heckman, Robin Thomas |
Independent sets in triangle-free cubic planar graphs. |
J. Comb. Theory, Ser. B |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Zi-Xia Song, Robin Thomas |
The extremal function for K9 minors. |
J. Comb. Theory, Ser. B |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Serguei Norine, Paul D. Seymour, Robin Thomas, Paul Wollan |
Proper minor-closed families are small. |
J. Comb. Theory, Ser. B |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohammad Ghebleh, Daniel Král, Serguei Norine, Robin Thomas |
The Circular Chromatic Index of Flower Snarks. |
Electr. J. Comb. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Robin Thomas, Xingxing Yu, Wenan Zang |
Hamilton paths in toroidal graphs. |
J. Comb. Theory, Ser. B |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Gunnar Brinkmann, Sam Greenberg, Catherine S. Greenhill, Brendan D. McKay, Robin Thomas, Paul Wollan |
Generation of simple quadrangulations of the sphere. |
Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Robin Thomas, Paul Wollan |
An improved linear edge bound for graph linkages. |
Eur. J. Comb. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Robin Thomas, Barrett Walls |
Three-coloring Klein bottle graphs of girth five. |
J. Comb. Theory, Ser. B |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Hlinený, Robin Thomas |
On possible counterexamples to Negami's planar cover conjecture. |
Journal of Graph Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Louis Kauffman, Robin Thomas |
Temperely-Lieb Algebras and the Four-Color Theorem. |
Combinatorica |
2003 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C15, 82B20 |
| 1 | Maria Chudnovsky, Neil Robertson, Paul D. Seymour, Robin Thomas |
Progress on perfect graphs. |
Math. Program. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Thor Johnson, Robin Thomas |
Generating Internally Four-Connected Graphs. |
J. Comb. Theory, Ser. B |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Thor Johnson, Neil Robertson, Paul D. Seymour, Robin Thomas |
Directed Tree-Width. |
J. Comb. Theory, Ser. B |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Christopher Carl Heckman, Robin Thomas |
A new proof of the independence ratio of triangle-free cubic graphs. |
Discrete Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruce A. Reed, Robin Thomas |
Clique Minors in Graphs and Their Complements. |
J. Comb. Theory, Ser. B |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Robin Thomas, Jan Mcdonald Thomson |
Excluding Minors In Nonplanar Graphs Of Girth At Least Five. |
Combinatorics, Probability & Computing |
2000 |
DBLP BibTeX RDF |
|
| 1 | Robin Thomas |
Digraph minors and algorithms (abstract only). |
SODA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Reinhard Diestel, Robin Thomas |
Excluding a Countable Clique. |
J. Comb. Theory, Ser. B |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Juvan, Bojan Mohar, Robin Thomas |
List Edge-Colorings of Series-Parallel Graphs. |
Electr. J. Comb. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Robin Thomas |
Graph Planarity and Related Topics. |
Graph Drawing |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas |
The Four-Colour Theorem. |
J. Comb. Theory, Ser. B |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Robin Thomas, Xingxing Yu |
Five-Connected Toroidal Graphs Are Hamiltonian. |
J. Comb. Theory, Ser. B |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour, Robin Thomas |
Tutte's Edge-Colouring Conjecture. |
J. Comb. Theory, Ser. B |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | William McCuaig, Neil Robertson, Paul D. Seymour, Robin Thomas |
Permanents, Pfaffian Orientations, and Even Directed Circuits (Extended Abstract). |
STOC |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruce A. Reed, Neil Robertson, Paul D. Seymour, Robin Thomas |
Packing Directed Circuits. |
Combinatorica |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas |
Efficiently Four-Coloring Planar Graphs. |
STOC |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour, Robin Thomas |
Sachs' Linkless Embedding Conjecture. |
J. Comb. Theory, Ser. B |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour, Robin Thomas |
Petersen Family Minors. |
J. Comb. Theory, Ser. B |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour, Robin Thomas |
Kuratowski Chains. |
J. Comb. Theory, Ser. B |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Vojtech Rödl, Robin Thomas |
On the Genus of a Random Graph. |
Random Struct. Algorithms |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Robin Thomas, Xingxing Yu |
4-Connected Projective-Planar Graphs Are Hamiltonian. |
J. Comb. Theory, Ser. B |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour, Robin Thomas |
Quickly Excluding a Planar Graph. |
J. Comb. Theory, Ser. B |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul D. Seymour, Robin Thomas |
Call Routing and the Ratcatcher. |
Combinatorica |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Paul D. Seymour, Robin Thomas |
Planar Separators. |
SIAM J. Discrete Math. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul D. Seymour, Robin Thomas |
Graph Searching and a Min-Max Theorem for Tree-Width. |
J. Comb. Theory, Ser. B |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Bogdan Oporowski, James G. Oxley, Robin Thomas |
Typical Subgraphs of 3- and 4-Connected Graphs. |
J. Comb. Theory, Ser. B |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour, Robin Thomas |
Hadwiger's conjecture for K 6-free graphs. |
Combinatorica |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Matousek, Robin Thomas |
On the complexity of finding iso- and other morphisms for partial k-trees. |
Discrete Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Hanno Lefmann, Vojtech Rödl, Robin Thomas |
Monochromatic Vs multicolored paths. |
Graphs and Combinatorics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Bienstock, Neil Robertson, Paul D. Seymour, Robin Thomas |
Quickly excluding a forest. |
J. Comb. Theory, Ser. B |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Kríz, Robin Thomas |
The menger-like property of the tree-width of infinite graphs. |
J. Comb. Theory, Ser. B |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul D. Seymour, Robin Thomas |
An end-faithful spanning tree counterexample. |
Discrete Mathematics |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour, Robin Thomas |
Excluding infinite minors. |
Discrete Mathematics |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Kríz, Robin Thomas |
Analyzing Nash-Williams' partition theorem by means of ordinal types. |
Discrete Mathematics |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Matousek, Robin Thomas |
Algorithms Finding Tree-Decompositions of Graphs. |
J. Algorithms |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour, Robin Thomas |
Structural descriptions of lower ideals of trees. |
Graph Structure Theory |
1991 |
DBLP BibTeX RDF |
|
| 1 | Neil Robertson, Paul D. Seymour, Robin Thomas |
A survey of linkless embeddings. |
Graph Structure Theory |
1991 |
DBLP BibTeX RDF |
|
| 1 | Robin Thomas |
A menger-like property of tree-width: The finite case. |
J. Comb. Theory, Ser. B |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Kríz, Robin Thomas |
Clique-sums, tree-decompositions and compactness. |
Discrete Mathematics |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Kríz, Robin Thomas |
On well-quasi-ordering finite structures with labels. |
Graphs and Combinatorics |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Paul D. Seymour, Robin Thomas |
A Separator Theorem for Graphs with an Excluded Minor and its Applications |
STOC |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Robin Thomas |
Graphs without K4 and well-quasi-ordering. |
J. Comb. Theory, Ser. B |
1985 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #78 of 78 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")