Остановите войну!
for scientists:
default search action
Robin Thomas 0001
- > Home > Persons > Robin Thomas 0001
Publications
- 2019
- [j87]Neil Robertson, Paul D. Seymour, Robin Thomas:
Girth Six Cubic Graphs Have Petersen Minors. Comb. 39(6): 1413-1423 (2019) - [j83]Neil Robertson, Paul D. Seymour, Robin Thomas:
Excluded minors in cubic graphs. J. Comb. Theory, Ser. B 138: 219-285 (2019) - 2017
- [j76]Neil Robertson, Paul D. Seymour, Robin Thomas:
Cyclically five-connected cubic graphs. J. Comb. Theory, Ser. B 125: 132-167 (2017) - 2016
- [j73]Katherine Edwards, Daniel P. Sanders, Paul D. Seymour, Robin Thomas:
Three-edge-colouring doublecross cubic graphs. J. Comb. Theory, Ser. B 119: 66-95 (2016) - 2015
- [i19]Neil Robertson, Paul D. Seymour, Robin Thomas:
Cyclically five-connected cubic graphs. CoRR abs/1503.02298 (2015) - [i16]Thor Johnson, Neil Robertson, Paul D. Seymour, Robin Thomas:
Excluding A Grid Minor In Planar Digraphs. CoRR abs/1510.00473 (2015) - 2014
- [i13]Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas:
Reducibility in the Four-Color Theorem. CoRR abs/1401.6481 (2014) - [i12]Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas:
Discharging cartwheels. CoRR abs/1401.6485 (2014) - [i10]Neil Robertson, Paul D. Seymour, Robin Thomas:
Girth six cubic graphs have Petersen minors. CoRR abs/1405.0533 (2014) - 2010
- [j59]Maria Chudnovsky, Neil Robertson, Paul D. Seymour, Robin Thomas:
K4-free graphs with no odd holes. J. Comb. Theory, Ser. B 100(3): 313-331 (2010) - 2006
- [j46]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) - 2003
- [j39]Maria Chudnovsky, Neil Robertson, Paul D. Seymour, Robin Thomas:
Progress on perfect graphs. Math. Program. 97(1-2): 405-422 (2003) - 2001
- [j36]Thor Johnson, Neil Robertson, Paul D. Seymour, Robin Thomas:
Directed Tree-Width. J. Comb. Theory, Ser. B 82(1): 138-154 (2001) - 1997
- [j29]Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas:
The Four-Colour Theorem. J. Comb. Theory, Ser. B 70(1): 2-44 (1997) - [j28]Neil Robertson, Paul D. Seymour, Robin Thomas:
Tutte's Edge-Colouring Conjecture. J. Comb. Theory, Ser. B 70(1): 166-183 (1997) - [c5]William McCuaig, Neil Robertson, Paul D. Seymour, Robin Thomas:
Permanents, Pfaffian Orientations, and Even Directed Circuits (Extended Abstract). STOC 1997: 402-405 - 1996
- [j27]Bruce A. Reed, Neil Robertson, Paul D. Seymour, Robin Thomas:
Packing Directed Circuits. Comb. 16(4): 535-554 (1996) - [j25]Paul D. Seymour, Robin Thomas:
Uniqueness of highly representative surface embeddings. J. Graph Theory 23(4): 337-349 (1996) - [c4]Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas:
Efficiently Four-Coloring Planar Graphs. STOC 1996: 571-575 - 1995
- [j24]Neil Robertson, Paul D. Seymour, Robin Thomas:
Kuratowski Chains. J. Comb. Theory, Ser. B 64(2): 127-154 (1995) - [j23]Neil Robertson, Paul D. Seymour, Robin Thomas:
Petersen Family Minors. J. Comb. Theory, Ser. B 64(2): 155-184 (1995) - [j22]Neil Robertson, Paul D. Seymour, Robin Thomas:
Sachs' Linkless Embedding Conjecture. J. Comb. Theory, Ser. B 64(2): 185-227 (1995) - 1994
- [j20]Paul D. Seymour, Robin Thomas:
Call Routing and the Ratcatcher. Comb. 14(2): 217-241 (1994) - [j18]Neil Robertson, Paul D. Seymour, Robin Thomas:
Quickly Excluding a Planar Graph. J. Comb. Theory, Ser. B 62(2): 323-348 (1994) - [j17]Noga Alon, Paul D. Seymour, Robin Thomas:
Planar Separators. SIAM J. Discret. Math. 7(2): 184-193 (1994) - 1993
- [j16]Neil Robertson, Paul D. Seymour, Robin Thomas:
Hadwiger's conjecture for K 6-free graphs. Comb. 13(3): 279-361 (1993) - [j14]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) - 1991
- [j10]Neil Robertson, Paul D. Seymour, Robin Thomas:
Excluding infinite minors. Discret. Math. 95(1-3): 303-319 (1991) - [j9]Paul D. Seymour, Robin Thomas:
An end-faithful spanning tree counterexample. Discret. Math. 95(1-3): 321-330 (1991) - [j6]Daniel Bienstock, Neil Robertson, Paul D. Seymour, Robin Thomas:
Quickly excluding a forest. J. Comb. Theory, Ser. B 52(2): 274-283 (1991) - [c3]Neil Robertson, Paul D. Seymour, Robin Thomas:
A survey of linkless embeddings. Graph Structure Theory 1991: 125-136 - [c2]Neil Robertson, Paul D. Seymour, Robin Thomas:
Structural descriptions of lower ideals of trees. Graph Structure Theory 1991: 525-538 - 1990
- [c1]Noga Alon, Paul D. Seymour, Robin Thomas:
A Separator Theorem for Graphs with an Excluded Minor and its Applications. STOC 1990: 293-299
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-02-06 23:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint