| Publication | Date of Publication | Type |
|---|
| Serial exchanges in random bases | 2025-01-06 | Paper |
| Cyclic orderings of paving matroids | 2024-11-09 | Paper |
| Rota's basis conjecture for matroids with density close to one | 2023-10-30 | Paper |
| Cyclic Orderings of Paving Matroids | 2023-08-23 | Paper |
| Girth conditions and Rota's basis conjecture | 2023-05-26 | Paper |
| Serial Exchanges in Random Bases | 2023-05-01 | Paper |
| Serial exchanges in matroids | 2021-11-23 | Paper |
| Frame matroids, toric ideals, and a conjecture of White | 2020-05-26 | Paper |
| The Alon-Tarsi conjecture: a perspective on the main results | 2019-08-20 | Paper |
| Contractible bonds in graphs | 2016-07-01 | Paper |
| A dichotomy theorem for circular colouring reconfiguration | 2016-06-30 | Paper |
| Constructing trees with graceful labelings using caterpillars | 2016-03-16 | Paper |
| A bound for the growth rate of binary matroids having no \(\mathrm{PG}(k-1,2)\)-minor | 2015-07-22 | Paper |
| A base exchange property for regular matroids | 2014-08-29 | Paper |
| Gallai's Conjecture For Graphs of Girth at Least Four | 2014-05-22 | Paper |
| Factors with Multiple Degree Constraints in Graphs | 2014-04-10 | Paper |
| Binary matroids with no 4-spike minors | 2014-03-20 | Paper |
| Dominating circuits in regular matroids | 2014-01-29 | Paper |
| An Erdős-Gallai theorem for matroids | 2012-07-10 | Paper |
| Cycle and cocycle coverings of graphs | 2010-12-14 | Paper |
| A conjecture of Welsh revisited | 2010-10-22 | Paper |
| Circuit and fractional circuit covers of matroids | 2010-06-17 | Paper |
| Ore-type and Dirac-type theorems for matroids | 2009-12-11 | Paper |
| Circuits through cocircuits in a graph with extensions to matroids | 2006-06-27 | Paper |
| Bonds intersecting cycles in a graph | 2006-06-27 | Paper |
| Double covers of cubic graphs with oddness 4 | 2005-03-08 | Paper |
| Contractible bonds in graphs | 2005-03-08 | Paper |
| Coloring the square of a planar graph | 2003-03-10 | Paper |
| Colouring arcwise connected sets in the plane. I | 2002-05-02 | Paper |
| Colouring arcwise connected sets in the plane. II | 2001-07-02 | Paper |
| On decomposing a graph into nontrivial bonds | 2001-02-06 | Paper |
| On bounding the chromatic number of L-graphs | 1996-08-22 | Paper |
| Restricted greedy clique decompositions and greedy clique decompositions of \(K_ 4\)-free graphs | 1995-05-18 | Paper |
| Greedy maximum-clique decompositions | 1995-05-18 | Paper |
| The greedy clique decomposition of a graph | 1994-07-04 | Paper |
| Transient Random Walks on Graphs and Metric Spaces with Applications to Hyperbolic Surfaces | 1992-09-27 | Paper |
| On the number of distinct minimal clique partitions and clique covers of a line graph | 1992-06-25 | Paper |
| Recurrent networks and a theorem of Nash-Williams | 1991-01-01 | Paper |
| Clique partitions of the cocktail party graph | 1986-01-01 | Paper |
