Hamilton decompositions of line graphs of perfectly 1-factorisable graphs of even degree. - David A. Pike (Australas. J Comb., 1995)

Hamilton decompositions of some line graphs. - David A. Pike (J. Graph Theory, 1995)

Decomposing block-intersection graphs of Steiner triple systems into triangles. - Elizabeth J. Billington; David A. Pike (Australas. J Comb., 1998)

The directed almost resolvable Hamilton-Waterloo problem. - Italo J. Dejter; David A. Pike; Christopher A. Rodger (Australas. J Comb., 1998)

Hamilton Decompositions of Block-Intersection Graphs of Steiner Triple Systems. - David A. Pike (Ars Comb., 1999)

The Use of Sklem Sequences to Generate Perfect One-Factorizations. - David A. Pike; Nabil Shalaby (Ars Comb., 2001)

Decycling Hypercubes. - David A. Pike (Graphs Comb., 2003)

Pancyclic BIBD block-intersection graphs. - Aygul Mamut; David A. Pike; Michael Edwin Raines (Discret. Math., 2004)

Decycling Cartesian Products of Two Cycles. - David A. Pike; Yubo Zou (SIAM J. Discret. Math., 2005)

Decycling of Fibonacci cubes. - Joanna A. Ellis-Monaghan; David A. Pike; Yubo Zou (Australas. J Comb., 2006)

Skolem labelled trees and Ps□Pt Cartesian products. - Alasdair Graham; David A. Pike; Nabil Shalaby (Australas. J Comb., 2007)

Existentially Closed BIBD Block-Intersection Graphs. - Neil A. McKay; David A. Pike (Electron. J. Comb., 2007)

Colouring even cycle systems. - Andrea C. Burgess; David A. Pike (Discret. Math., 2008)

Pancyclic PBD block-intersection graphs. - Graham A. Case; David A. Pike (Discret. Math., 2008)

Edge searching weighted graphs. - Öznur Yasar; Danny Dyer; David A. Pike; Margo Kondratieva (Discret. Appl. Math., 2009)

Hamiltonicity and restricted block-intersection graphs of t-designs. - David A. Pike; Robert C. Vandell; Matthew Walsh 001 (Discret. Math., 2009)

Properties of the Steiner Triple Systems of Order 19. - Charles J. Colbourn; Anthony D. Forbes; Mike J. Grannell; Terry S. Griggs; Petteri Kaski; Patric R. J. Östergård; David A. Pike; Olli Pottonen (Electron. J. Comb., 2010)

On cycle systems with specified weak chromatic number. - Daniel Horsley; David A. Pike (J. Comb. Theory A, 2010)

Hamilton cycles in restricted block-intersection graphs. - Andrew T. Jesso; David A. Pike; Nabil Shalaby (Des. Codes Cryptogr., 2011)

Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19. - Charles J. Colbourn; Petteri Kaski; Patric R. J. Östergård; David A. Pike; Olli Pottonen (Discret. Math., 2011)

The modular product and existential closure. - David A. Pike; Asiyeh Sanaei (Australas. J Comb., 2012)

The modular product and existential closure II. - David A. Pike; Asiyeh Sanaei (Australas. J Comb., 2013)

Brushing without capacity restrictions. - Darryn E. Bryant; Nevena Francetic; Przemyslaw Gordinowicz; David A. Pike; Pawel Pralat (Discret. Appl. Math., 2014)

On balanced incomplete block designs with specified weak chromatic number. - Daniel Horsley; David A. Pike (J. Comb. Theory A, 2014)

A deterministic version of the game of zombies and survivors on graphs. - Shannon L. Fitzpatrick; Jared Howell; Margaret-Ellen Messinger; David A. Pike (Discret. Appl. Math., 2016)

Hamiltonicity and cycle extensions in 0-block-intersection graphs of balanced incomplete block designs. - Jason T. LeGrow; David A. Pike; Jonathan Poulin (Des. Codes Cryptogr., 2016)

The chromatic index of block intersection graphs of Kirkman triple systems and cyclic Steiner triple systems. - Iren Darijani; David A. Pike; Jonathan Poulin (Australas. J Comb., 2017)

Twofold triple systems without 2-intersecting Gray codes. - Aras Erzurumluoglu; David A. Pike (Des. Codes Cryptogr., 2017)

Cycle Extensions in PBD Block-Intersection Graphs. - Robert D. Luther; David A. Pike (Ars Comb., 2018)

Brushing Number and Zero-Forcing Number of Graphs and Their Line Graphs. - Aras Erzurumluoglu; Karen Meagher; David A. Pike (Graphs Comb., 2018)

Decomposable Twofold Triple Systems with Non-Hamiltonian 2-Block Intersection Graphs. - Rosalind A. Cameron; David A. Pike (Electron. J. Comb., 2020)

Cops that surround a robber. - Andrea C. Burgess; Rosalind A. Cameron; Nancy E. Clarke; Peter Danziger; Stephen Finbow; Caleb W. Jones; David A. Pike (Discret. Appl. Math., 2020)

The firebreak problem. - Kathleen D. Barnetson; Andrea C. Burgess; Jessica A. Enright; Jared Howell; David A. Pike; Brady Ryan (Networks, 2021)

Mutually orthogonal cycle systems. - Andrea C. Burgess; Nicholas J. Cavenagh; David A. Pike (Ars Math. Contemp., 2022)

The edge-connectivity of vertex-transitive hypergraphs. - Andrea C. Burgess; Robert D. Luther; David A. Pike (J. Graph Theory, 2024)

Existential Closure in Line Graphs. - Andrea C. Burgess; Robert D. Luther; David A. Pike (Graphs Comb., 2024)

Existential closure in uniform hypergraphs. - Andrea C. Burgess; Robert D. Luther; David A. Pike (Discret. Math., 2025)

Weak colourings of Kirkman triple systems. - Andrea C. Burgess; Nicholas J. Cavenagh; Peter Danziger; David A. Pike (Des. Codes Cryptogr., 2025)

Firefighting with a distance-based restriction. - Andrea C. Burgess; John Marcoux; David A. Pike (Discret. Appl. Math., 2026)