11 citations · 23 across the 6 of their papers we have counts for
9 papers
Excluding A Grid Minor In Planar Digraphs
Thor Johnson, Neil Robertson, Paul Seymour +1
In [Directed tree-width, J. Combin. Theory Ser. B 82 (2001), 138-154] we introduced the notion of tree-width of directed graphs and presented a conjecture, formulated during discus…
Cyclically five-connected cubic graphs
Neil Robertson, P. D. Seymour, Robin Thomas
A cubic graph is cyclically 5-connected if is simple, 3-connected, has at least 10 vertices and for every set of edges of size at most four, at most one component of $G…
Girth six cubic graphs have Petersen minors
Neil Robertson, Paul Seymour, Robin Thomas
We prove that every 3-regular graph with no circuit of length less than six has a subgraph isomorphic to a subdivision of the Petersen graph.
Excluded minors in cubic graphs
Neil Robertson, Paul Seymour, Robin Thomas
Let G be a cubic graph, with girth at least five, such that for every partition X,Y of its vertex set with |X|,|Y|>6 there are at least six edges between X and Y. We prove that if…
Discharging cartwheels
Neil Robertson, Daniel P. Sanders, Paul Seymour +1
In [J. Combin. Theory Ser. B 70 (1997), 2-44] we gave a simplified proof of the Four-Color Theorem. The proof is computer-assisted in the sense that for two lemmas in the article w…
Reducibility in the Four-Color Theorem
Neil Robertson, Daniel P. Sanders, Paul Seymour +1
In [J. Combin. Theory Ser. B 70 (1997), 2-44] we gave a simplified proof of the Four-Color Theorem. The proof is computer-assisted in the sense that for two lemmas in the article w…