A note on the three color problem. - Daniel P. Sanders 001; Yue Zhao 008 (Graphs Comb., 1995)

On Diagonally 10-Coloring Plane Triangulations. - Daniel P. Sanders 001; Yue Zhao 008 (J. Graph Theory, 1995)

Efficiently Four-Coloring Planar Graphs. - Neil Robertson 001; Daniel P. Sanders 001; Paul D. Seymour; Robin Thomas 001 (STOC, 1996)

On circuits through five edges. - Daniel P. Sanders 001 (Discret. Math., 1996)

On the face touching number. - Daniel P. Sanders 001 (J. Graph Theory, 1996)

On Hamilton cycles in certain planar graphs. - Daniel P. Sanders 001 (J. Graph Theory, 1996)

On the effect of major vertices on the number of light edges. - Daniel P. Sanders 001 (J. Graph Theory, 1996)

On light edges and triangles in projective planar graphs. - Daniel P. Sanders 001 (J. Graph Theory, 1996)

On d-diagonal colorings. - Daniel P. Sanders 001; Yue Zhao 008 (J. Graph Theory, 1996)

On Linear Recognition of Tree-Width at Most Four. - Daniel P. Sanders 001 (SIAM J. Discret. Math., 1996)

On Simultaneous Edge-Face Colorings of Plane Graphs. - Daniel P. Sanders 001; Yue Zhao 008 (Comb., 1997)

The Four-Colour Theorem. - Neil Robertson 001; Daniel P. Sanders 001; Paul D. Seymour; Robin Thomas 001 (J. Comb. Theory B, 1997)

On paths in planar graphs. - Daniel P. Sanders 001 (J. Graph Theory, 1997)

Partitioning Graphs of Bounded Tree-Width. - Guoli Ding; Bogdan Oporowski; Daniel P. Sanders 001; Dirk Vertigan (Comb., 1998)

On bi d-Diagonal Colorings of Embedded Graphs of Low Maximum Face Size. - Daniel P. Sanders 001; Yue Zhao 008 (Graphs Comb., 1998)

On 2-Connected Spanning Subgraphs with Low Maximum Degree. - Daniel P. Sanders 001; Yue Zhao 008 (J. Comb. Theory B, 1998)

On cyclic colorings and their generalizations. - Oleg V. Borodin; Daniel P. Sanders 001; Yue Zhao 008 (Discret. Math., 1999)

On total 9-coloring planar graphs of maximum degree seven. - Daniel P. Sanders 001; Yue Zhao 008 (J. Graph Theory, 1999)

On simultaneous colorings of embedded graphs. - Daniel P. Sanders 001; John Maharry (Discret. Math., 2000)

A five-color theorem. - Daniel P. Sanders 001; Yue Zhao 008 (Discret. Math., 2000)

Surfaces, Tree-Width, Clique-Minors, and Partitions. - Guoli Ding; Bogdan Oporowski; Daniel P. Sanders 001; Dirk L. Vertigan (J. Comb. Theory B, 2000)

Coloring edges of embedded graphs. - Daniel P. Sanders 001; Yue Zhao 008 (J. Graph Theory, 2000)

On Improving the Edge-Face Coloring Theorem. - Daniel P. Sanders 001; Yue Zhao 008 (Graphs Comb., 2001)

A New Bound on the Cyclic Chromatic Number. - Daniel P. Sanders 001; Yue Zhao 008 (J. Comb. Theory B, 2001)

Planar Graphs of Maximum Degree Seven are Class I. - Daniel P. Sanders 001; Yue Zhao 008 (J. Comb. Theory B, 2001)

On spanning trees and walks of low maximum degree. - Daniel P. Sanders 001; Yue Zhao 008 (J. Graph Theory, 2001)

On the Size of Edge Chromatic Critical Graphs. - Daniel P. Sanders 001; Yue Zhao 008 (J. Comb. Theory B, 2002)

Coloring the Faces of Convex Polyhedra so That Like Colors Are Far Apart. - Daniel P. Sanders 001; Yue Zhao 008 (J. Comb. Theory B, 2002)

Coloring edges of graphs embedded in a surface of characteristic zero. - Daniel P. Sanders 001; Yue Zhao 008 (J. Comb. Theory B, 2003)

Excluding any graph as a minor allows a low tree-width 2-coloring. - Matt DeVos; Guoli Ding; Bogdan Oporowski; Daniel P. Sanders 001; Bruce A. Reed; Paul D. Seymour; Dirk Vertigan (J. Comb. Theory B, 2004)

Reducibility in the Four-Color Theorem. - Neil Robertson 001; Daniel P. Sanders 001; Paul D. Seymour; Robin Thomas 001 (CoRR, 2014)

Discharging cartwheels. - Neil Robertson 001; Daniel P. Sanders 001; Paul D. Seymour; Robin Thomas 001 (CoRR, 2014)

Three-edge-colouring doublecross cubic graphs. - Katherine Edwards; Daniel P. Sanders 001; Paul D. Seymour; Robin Thomas 001 (J. Comb. Theory B, 2016)