Even time constraints on the watchman's walk. - Iain Beaton; Rory Begin; Stephen Finbow; Christopher M. van Bommel (Australas. J Comb., 2013)

The domination equivalence classes of paths. - Iain Beaton; Jason I. Brown (Australas. J Comb., 2019)

Independence equivalence classes of paths and cycles. - Iain Beaton; Jason I. Brown; Ben Cameron (Australas. J Comb., 2019)

Optimal Domination Polynomials. - Iain Beaton; Jason I. Brown; Danielle Cox (Graphs Comb., 2020)

On the real roots of domination polynomials. - Jason I. Brown; Iain Beaton (Contributions Discret. Math., 2021)

The average order of dominating sets of a graph. - Iain Beaton; Jason I. Brown (Discret. Math., 2021)

On the Unimodality of Domination Polynomials. - Iain Beaton; Jason I. Brown (Graphs Comb., 2022)

Chromatic Polynomials of 2-Edge-Coloured Graphs. - Iain Beaton; Danielle Cox; Christopher Duffy 001; Nicole Zolkavich (Electron. J. Comb., 2023)

A tight upper bound on the average order of dominating sets of a graph. - Iain Beaton; Ben Cameron (J. Graph Theory, 2024)

Vertex-Critical (P5,W4)-Free Graphs. - Wen Xia; Jorik Jooken; Jan Goedgebeur; Iain Beaton; Ben Cameron; Shenwei Huang (COCOON (2), 2025)

Vertex-critical graphs in co-gem-free graphs. - Iain Beaton; Ben Cameron (Theor. Comput. Sci., 2025)