Upper Bounds for a Ramsey Theorem for Trees. - Conrad Johann Swanepoel; Lourens M. Pretorius (Graphs Comb., 1994)

Factor-complement partitions of ascending k-parameter words. - Conrad Johann Swanepoel; Lourens M. Pretorius (Discret. Math., 1997)

Partition theorems for factorisations of ascending parameter words. - Willem L. Fouché; Lourens M. Pretorius; Conrad Johann Swanepoel (Discret. Math., 1999)

Partitions of factorisations of parameter words. - Willem L. Fouché; Lourens M. Pretorius; Conrad Johann Swanepoel (Discret. Math., 2001)

An Algorithmic Proof of the Motzkin-Rabin Theorem on Monochrome Lines. - Lourens M. Pretorius; Konrad J. Swanepoel (Am. Math. Mon., 2004)

Ramsey degrees of bipartite graphs: A primitive recursive proof. - Willem L. Fouché; Lourens M. Pretorius; Conrad Johann Swanepoel (Discret. Math., 2005)

Blocking sets in small finite linear spaces. - Lourens M. Pretorius; Konrad J. Swanepoel (Ars Comb., 2006)

Sylvester-Gallai Theorems for Complex Numbers and Quaternions. - Noam D. Elkies; Lourens M. Pretorius; Conrad Johann Swanepoel (Discret. Comput. Geom., 2006)

The Sylvester-Gallai theorem, colourings and algebra. - Lourens M. Pretorius; Konrad J. Swanepoel (Discret. Math., 2009)

Embedding a Latin square with transversal into a projective space. - Lourens M. Pretorius; Konrad J. Swanepoel (J. Comb. Theory A, 2011)