| 2004 |
|---|
| 18 | EE | Matt DeVos,
Guoli Ding,
Bogdan Oporowski,
Daniel P. Sanders,
Bruce A. Reed,
Paul D. Seymour,
Dirk Vertigan:
Excluding any graph as a minor allows a low tree-width 2-coloring.
J. Comb. Theory, Ser. B 91(1): 25-41 (2004) |
| 2003 |
|---|
| 17 | EE | Daniel P. Sanders,
Yue Zhao:
Coloring edges of graphs embedded in a surface of characteristic zero.
J. Comb. Theory, Ser. B 87(2): 254-263 (2003) |
| 2002 |
|---|
| 16 | EE | Daniel P. Sanders,
Yue Zhao:
Coloring the Faces of Convex Polyhedra so That Like Colors Are Far Apart.
J. Comb. Theory, Ser. B 85(2): 348-360 (2002) |
| 15 | EE | Daniel P. Sanders,
Yue Zhao:
On the Size of Edge Chromatic Critical Graphs.
J. Comb. Theory, Ser. B 86(2): 408-412 (2002) |
| 2001 |
|---|
| 14 | EE | Daniel P. Sanders,
Yue Zhao:
On Improving the Edge-Face Coloring Theorem.
Graphs and Combinatorics 17(2): 329-341 (2001) |
| 13 | EE | Daniel P. Sanders,
Yue Zhao:
A New Bound on the Cyclic Chromatic Number.
J. Comb. Theory, Ser. B 83(1): 102-111 (2001) |
| 12 | EE | Daniel P. Sanders,
Yue Zhao:
Planar Graphs of Maximum Degree Seven are Class I.
J. Comb. Theory, Ser. B 83(2): 201-212 (2001) |
| 2000 |
|---|
| 11 | EE | Daniel P. Sanders,
Yue Zhao:
A five-color theorem.
Discrete Mathematics 220(1-3): 279-281 (2000) |
| 10 | EE | Daniel P. Sanders,
John Maharry:
On simultaneous colorings of embedded graphs.
Discrete Mathematics 224(1-3): 207-214 (2000) |
| 9 | EE | Guoli Ding,
Bogdan Oporowski,
Daniel P. Sanders,
Dirk L. Vertigan:
Surfaces, Tree-Width, Clique-Minors, and Partitions.
J. Comb. Theory, Ser. B 79(2): 221-246 (2000) |
| 1999 |
|---|
| 8 | EE | Oleg V. Borodin,
Daniel P. Sanders,
Yue Zhao:
On cyclic colorings and their generalizations.
Discrete Mathematics 203(1-3): 23-40 (1999) |
| 1998 |
|---|
| 7 | EE | Guoli Ding,
Bogdan Oporowski,
Daniel P. Sanders,
Dirk Vertigan:
Partitioning Graphs of Bounded Tree-Width.
Combinatorica 18(1): 1-12 (1998) |
| 6 | EE | Daniel P. Sanders,
Yue Zhao:
On 2-Connected Spanning Subgraphs with Low Maximum Degree.
J. Comb. Theory, Ser. B 74(1): 64-86 (1998) |
| 1997 |
|---|
| 5 | | Daniel P. Sanders,
Yue Zhao:
On Simultaneous Edge-Face Colorings of Plane Graphs.
Combinatorica 17(3): 441-445 (1997) |
| 4 | EE | Neil Robertson,
Daniel P. Sanders,
Paul D. Seymour,
Robin Thomas:
The Four-Colour Theorem.
J. Comb. Theory, Ser. B 70(1): 2-44 (1997) |
| 1996 |
|---|
| 3 | EE | Neil Robertson,
Daniel P. Sanders,
Paul D. Seymour,
Robin Thomas:
Efficiently Four-Coloring Planar Graphs.
STOC 1996: 571-575 |
| 2 | EE | Daniel P. Sanders:
On circuits through five edges.
Discrete Mathematics 159(1-3): 199-215 (1996) |
| 1 | EE | Daniel P. Sanders:
On Linear Recognition of Tree-Width at Most Four.
SIAM J. Discrete Math. 9(1): 101-117 (1996) |
