11 citations · 23 across the 6 of their papers we have counts for
4 papers · 1 filter
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…