| Molecular Inverse-Design Platform for Material Industries | 0 | 0.34 | 2020 |
| Expert-in-the-loop AI for Polymer Discovery | 0 | 0.34 | 2020 |
| Three-edge-colouring doublecross cubic graphs | 1 | 0.34 | 2016 |
| Discharging cartwheels. | 0 | 0.34 | 2014 |
| Reducibility in the Four-Color Theorem. | 0 | 0.34 | 2014 |
| Excluding any graph as a minor allows a low tree-width 2-coloring | 53 | 2.67 | 2004 |
| Coloring edges of graphs embedded in a surface of characteristic zero | 11 | 1.05 | 2003 |
| Coloring the faces of convex polyhedra so that like colors are far apart | 2 | 0.63 | 2002 |
| On the size of edge chromatic critical graphs | 6 | 0.72 | 2002 |
| Planar graphs of maximum degree seven are Class I | 76 | 5.36 | 2001 |
| A new bound on the cyclic chromatic number | 22 | 1.88 | 2001 |
| On Improving the Edge-Face Coloring Theorem | 8 | 2.12 | 2001 |
| On spanning trees and walks of low maximum degree | 5 | 0.46 | 2001 |
| Surfaces, tree-width, clique-minors, and partitions | 18 | 1.57 | 2000 |
| A five-color theorem | 4 | 0.47 | 2000 |
| Coloring edges of embedded graphs | 2 | 0.46 | 2000 |
| On simultaneous colorings of embedded graphs | 3 | 0.60 | 2000 |
| On Cyclic Colorings And Their Generalizations | 22 | 2.32 | 1999 |
| On total 9-coloring planar graphs of maximum degree seven | 51 | 5.08 | 1999 |
| Partitioning Graphs of Bounded Tree-Width | 17 | 1.25 | 1998 |
| On 2-connected spanning subgraphs with low maximum degree | 14 | 0.96 | 1998 |
| On <FORMULA FORM="INLINE">${\bi d}$</FORMULA>-Diagonal Colorings of Embedded Graphs of Low Maximum Face Size | 2 | 0.50 | 1998 |
| On paths in planar graphs | 30 | 2.52 | 1997 |
| On Simultaneous Edge-Face Colorings Of Plane Graphs | 14 | 1.09 | 1997 |
| On d-diagonal colorings | 6 | 0.88 | 1996 |
| On Circuits Through Five Edges | 3 | 0.48 | 1996 |
| On the effect of major vertices on the number of light edges | 1 | 1.37 | 1996 |
| On light edges and triangles in projective planar graphs | 5 | 0.55 | 1996 |
| On the face touching number | 1 | 0.40 | 1996 |
| Efficiently four-coloring planar graphs | 30 | 2.08 | 1996 |
| On Hamilton cycles in certain planar graphs | 5 | 0.74 | 1996 |
| On Linear Recognition of Tree-Width at Most Four | 26 | 1.68 | 1996 |
| On diagonally 10-coloring plane triangulations | 5 | 0.75 | 1995 |
| A note on the three color problem | 28 | 3.21 | 1995 |
