Daniel P. Sanders

发表

A new proof of the four-colour theorem

P. Seymour, N. Robertson, Robin Thomas, 1996 .

On acyclic colorings of graphs on surfaces

N. Alon, B. Mohar, Daniel P. Sanders, 1996 .

Linear algorithms for graphs of tree-width at most four

Daniel P. Sanders, 1993 .

On the face touching number

Daniel P. Sanders, 1996 .

On Light Edges and Triangles in Planar Graphs of Minimum Degree Five

Oleg V. Borodin, Daniel P. Sanders, 2006 .

On total 9-coloring planar graphs of maximum degree seven

Yue Zhao, Daniel P. Sanders, 1999 .

On paths in planar graphs

Daniel P. Sanders, 1997 .

On d -diagonal colorings

Yue Zhao, Daniel P. Sanders, 1996 .

On spanning trees and walks of low maximum degree

Yue Zhao, Yue Zhao, Daniel P. Sanders, 2001 .

On Hamilton cycles in certain planar graphs

Daniel P. Sanders, 1996 .

On the Entire Coloring Conjecture

Yue Zhao, Daniel P. Sanders, 2000, Canadian Mathematical Bulletin.

On light edges and triangles in projective planar graphs

Daniel P. Sanders, 1996 .

PARTITIONING INTO TWO GRAPHS WITH ONLY

D. Vertigan, Daniel P. Sanders, Bogdan Oporowski, 1996 .

On spanning trees and walks of low maximum degree

Yue Zhao, Daniel P. Sanders, 2001, J. Graph Theory.

The Four-Colour Theorem

Robin Thomas, Paul D. Seymour, Neil Robertson, 1997, J. Comb. Theory, Ser. B.

A note on the three color problem

Yue Zhao, Daniel P. Sanders, Yue Zhao, 1995, Graphs Comb..

Surfaces, Tree-Width, Clique-Minors, and Partitions

Bogdan Oporowski, Guoli Ding, Dirk L. Vertigan, 2000, J. Comb. Theory, Ser. B.

Planar Graphs of Maximum Degree Seven are Class I

Yue Zhao, Daniel P. Sanders, Yue Zhao, 2001, J. Comb. Theory B.

On the Size of Edge Chromatic Critical Graphs

Yue Zhao, Daniel P. Sanders, Yue Zhao, 2002, J. Comb. Theory, Ser. B.

Coloring edges of embedded graphs

Yue Zhao, Daniel P. Sanders, Yue Zhao, 2000, Journal of Graph Theory.

Excluding any graph as a minor allows a low tree-width 2-coloring

Bruce A. Reed, Paul D. Seymour, Matt DeVos, 2004, J. Comb. Theory, Ser. B.

Efficiently four-coloring planar graphs

Robin Thomas, Paul D. Seymour, Neil Robertson, 1996, STOC '96.

On circuits through five edges

Daniel P. Sanders, Daniel P. Sanders, 1996, Discret. Math..

Coloring the Faces of Convex Polyhedra so That Like Colors Are Far Apart

Yue Zhao, Daniel P. Sanders, Yue Zhao, 2002, J. Comb. Theory, Ser. B.

Partitioning Graphs of Bounded Tree-Width

Bogdan Oporowski, Guoli Ding, Dirk L. Vertigan, 1998, Comb..