2 citations · 3 across the 3 of their papers we have counts for
3 papers · 1 filter
Three-edge-colouring doublecross cubic graphs
Katherine Edwards, Daniel P. Sanders, Paul Seymour +1
A graph is apex if there is a vertex whose deletion makes the graph planar, and doublecross if it can be drawn in the plane with only two crossings, both incident with the infinite…
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…