Daniel P. Sanders

33 papers A* 1Journal 32
YearRankTypeTitle / Venue / Authors
2016 J jnl
Three-edge-colouring doublecross cubic graphs.
J. Comb. Theory B
Katherine Edwards, Daniel P. Sanders, Paul D. Seymour, Robin Thomas
2014 J jnl
Discharging cartwheels.
CoRR
Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas
2014 J jnl
Reducibility in the Four-Color Theorem.
CoRR
Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas
2004 J jnl
Excluding any graph as a minor allows a low tree-width 2-coloring.
J. Comb. Theory B
Matt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce A. Reed, Paul D. Seymour, Dirk Vertigan
2003 J jnl
Coloring edges of graphs embedded in a surface of characteristic zero.
J. Comb. Theory B
Daniel P. Sanders, Yue Zhao
2002 J jnl
Coloring the Faces of Convex Polyhedra so That Like Colors Are Far Apart.
J. Comb. Theory B
Daniel P. Sanders, Yue Zhao
2002 J jnl
On the Size of Edge Chromatic Critical Graphs.
J. Comb. Theory B
Daniel P. Sanders, Yue Zhao
2001 J jnl
A New Bound on the Cyclic Chromatic Number.
J. Comb. Theory B
Daniel P. Sanders, Yue Zhao
2001 J jnl
On Improving the Edge-Face Coloring Theorem.
Graphs Comb.
Daniel P. Sanders, Yue Zhao
2001 J jnl
On spanning trees and walks of low maximum degree.
J. Graph Theory
Daniel P. Sanders, Yue Zhao
2001 J jnl
Planar Graphs of Maximum Degree Seven are Class I.
J. Comb. Theory B
Daniel P. Sanders, Yue Zhao
2000 J jnl
A five-color theorem.
Discret. Math.
Daniel P. Sanders, Yue Zhao
2000 J jnl
Coloring edges of embedded graphs.
J. Graph Theory
Daniel P. Sanders, Yue Zhao
2000 J jnl
On simultaneous colorings of embedded graphs.
Discret. Math.
Daniel P. Sanders, John Maharry
2000 J jnl
Surfaces, Tree-Width, Clique-Minors, and Partitions.
J. Comb. Theory B
Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk L. Vertigan
1999 J jnl
On cyclic colorings and their generalizations.
Discret. Math.
Oleg V. Borodin, Daniel P. Sanders, Yue Zhao
1999 J jnl
On total 9-coloring planar graphs of maximum degree seven.
J. Graph Theory
Daniel P. Sanders, Yue Zhao
1998 J jnl
On 2-Connected Spanning Subgraphs with Low Maximum Degree.
J. Comb. Theory B
Daniel P. Sanders, Yue Zhao
1998 J jnl
On \bi
Graphs Comb.
Daniel P. Sanders, Yue Zhao
1998 J jnl
Partitioning Graphs of Bounded Tree-Width.
Comb.
Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk Vertigan
1997 J jnl
On Simultaneous Edge-Face Colorings of Plane Graphs.
Comb.
Daniel P. Sanders, Yue Zhao
1997 J jnl
On paths in planar graphs.
J. Graph Theory
Daniel P. Sanders
1997 J jnl
The Four-Colour Theorem.
J. Comb. Theory B
Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas
1996 A* conf
Efficiently Four-Coloring Planar Graphs.
STOC
Neil Robertson, Daniel P. Sanders, Paul D. Seymour, Robin Thomas
1996 J jnl
On
J. Graph Theory
Daniel P. Sanders, Yue Zhao
1996 J jnl
On Hamilton cycles in certain planar graphs.
J. Graph Theory
Daniel P. Sanders
1996 J jnl
On Linear Recognition of Tree-Width at Most Four.
SIAM J. Discret. Math.
Daniel P. Sanders
1996 J jnl
On circuits through five edges.
Discret. Math.
Daniel P. Sanders
1996 J jnl
On light edges and triangles in projective planar graphs.
J. Graph Theory
Daniel P. Sanders
1996 J jnl
On the effect of major vertices on the number of light edges.
J. Graph Theory
Daniel P. Sanders
1996 J jnl
On the face touching number.
J. Graph Theory
Daniel P. Sanders
1995 J jnl
A note on the three color problem.
Graphs Comb.
Daniel P. Sanders, Yue Zhao
1995 J jnl
On Diagonally 10-Coloring Plane Triangulations.
J. Graph Theory
Daniel P. Sanders, Yue Zhao