Colouring Arcwise Connected Sets in the Plane I
Coluring Arcwise Connected Sets in the Plane II
Defining Matroids Through Sequential Selection
Bonds Intersecting Cycles in a Graph
Circuits Through Cocircuits in a Graph with Extensions to Matroids
Double Covers of Cubic Graphs with Oddness 4
Greedy Clique Decompositions of K4-Free Graphs
Greedy Maximum-Clique Decompositions
Transient Random Walks on Graphs and Metric Spaces
Recurrent Networks and a Theorem of Nash-Williams
Colouring the Square of a Planar Graph
Removable Circuits in Multigraphs
Greedy Clique Decompositions and the Turan Numbers
Transient Networks and Fattenings of the Line
On Decomposing 4-Partite Graphs Into Triangles
On the number of distinct minimal clique partitions and clique covers of a line graph