Daniel P. Sanders

According to our database, Daniel P. Sanders authored at least 33 papers between 1995 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

Three-edge-colouring doublecross cubic graphs.

Katherine Edwards, Daniel P. Sanders, Paul D. Seymour, Robin Thomas

J. Comb. Theory B, 2016

2014

Discharging cartwheels.

Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas

CoRR, 2014

Reducibility in the Four-Color Theorem.

Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas

CoRR, 2014

2004

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

Matt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce A. Reed, Paul D. Seymour, Dirk Vertigan

J. Comb. Theory B, 2004

2003

Coloring edges of graphs embedded in a surface of characteristic zero.

Daniel P. Sanders, Yue Zhao

J. Comb. Theory B, 2003

2002

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

Daniel P. Sanders, Yue Zhao

J. Comb. Theory B, 2002

On the Size of Edge Chromatic Critical Graphs.

Daniel P. Sanders, Yue Zhao

J. Comb. Theory B, 2002

2001

On spanning trees and walks of low maximum degree.

Daniel P. Sanders, Yue Zhao

J. Graph Theory, 2001

Planar Graphs of Maximum Degree Seven are Class I.

Daniel P. Sanders, Yue Zhao

J. Comb. Theory B, 2001

A New Bound on the Cyclic Chromatic Number.

Daniel P. Sanders, Yue Zhao

J. Comb. Theory B, 2001

On Improving the Edge-Face Coloring Theorem.

Daniel P. Sanders, Yue Zhao

Graphs Comb., 2001

2000

Coloring edges of embedded graphs.

Daniel P. Sanders, Yue Zhao

J. Graph Theory, 2000

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

Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk L. Vertigan

J. Comb. Theory B, 2000

A five-color theorem.

Daniel P. Sanders, Yue Zhao

Discret. Math., 2000

On simultaneous colorings of embedded graphs.

Daniel P. Sanders, John Maharry

Discret. Math., 2000

1999

On total 9-coloring planar graphs of maximum degree seven.

Daniel P. Sanders, Yue Zhao

J. Graph Theory, 1999

On cyclic colorings and their generalizations.

Oleg V. Borodin, Daniel P. Sanders, Yue Zhao

Discret. Math., 1999

1998

On 2-Connected Spanning Subgraphs with Low Maximum Degree.

Daniel P. Sanders, Yue Zhao

J. Comb. Theory B, 1998

On \bi <i>d</i>-Diagonal Colorings of Embedded Graphs of Low Maximum Face Size.

Daniel P. Sanders, Yue Zhao

Graphs Comb., 1998

Partitioning Graphs of Bounded Tree-Width.

Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk Vertigan

Comb., 1998

1997

On paths in planar graphs.

Daniel P. Sanders

J. Graph Theory, 1997

The Four-Colour Theorem.

Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas

J. Comb. Theory B, 1997

On Simultaneous Edge-Face Colorings of Plane Graphs.

Daniel P. Sanders, Yue Zhao

Comb., 1997

1996

On Linear Recognition of Tree-Width at Most Four.

Daniel P. Sanders

SIAM J. Discret. Math., 1996

On <i>d</i>-diagonal colorings.

Daniel P. Sanders, Yue Zhao

J. Graph Theory, 1996

On light edges and triangles in projective planar graphs.

Daniel P. Sanders

J. Graph Theory, 1996

On the effect of major vertices on the number of light edges.

Daniel P. Sanders

J. Graph Theory, 1996

On Hamilton cycles in certain planar graphs.

Daniel P. Sanders

J. Graph Theory, 1996

On the face touching number.

Daniel P. Sanders

J. Graph Theory, 1996

On circuits through five edges.

Daniel P. Sanders

Discret. Math., 1996

Efficiently Four-Coloring Planar Graphs.

Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas

Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

1995

On Diagonally 10-Coloring Plane Triangulations.

Daniel P. Sanders, Yue Zhao

J. Graph Theory, 1995

A note on the three color problem.

Daniel P. Sanders, Yue Zhao

Graphs Comb., 1995