Iain Beaton

According to our database, Iain Beaton authored at least 14 papers between 2013 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2026

Vertex-critical graphs in subfamilies of (P₄+ℓ P₁)-free graphs.

Iain Beaton, Ben Cameron

CoRR, April, 2026

Vertex-critical (P5, W4)-free graphs.

Wen Xia, Jorik Jooken, Jan Goedgebeur, Iain Beaton, Ben Cameron, Shenwei Huang

Theor. Comput. Sci., 2026

Vertex-Critical Graphs in Subfamilies of (P_4+ℓ P₁₎-Free Graphs.

Iain Beaton, Ben Cameron

Proceedings of the Combinatorial Algorithms - 37th International Workshop, 2026

2025

Vertex-critical graphs in co-gem-free graphs.

Iain Beaton, Ben Cameron

Theor. Comput. Sci., 2025

Vertex-Critical (P_5,W₄₎-Free Graphs.

Wen Xia, Jorik Jooken, Jan Goedgebeur, Iain Beaton, Ben Cameron, Shenwei Huang

Proceedings of the Computing and Combinatorics, 2025

2024

A tight upper bound on the average order of dominating sets of a graph.

Iain Beaton, Ben Cameron

J. Graph Theory, 2024

2023

Chromatic Polynomials of 2-Edge-Coloured Graphs.

Iain Beaton, Danielle Cox, Christopher Duffy, Nicole Zolkavich

Electron. J. Comb., 2023

2022

On the Unimodality of Domination Polynomials.

Iain Beaton, Jason I. Brown

Graphs Comb., 2022

2021

The average order of dominating sets of a graph.

Iain Beaton, Jason I. Brown

Discret. Math., 2021

On the real roots of domination polynomials.

Jason I. Brown, Iain Beaton

Contributions Discret. Math., 2021

2020

Optimal Domination Polynomials.

Iain Beaton, Jason I. Brown, Danielle Cox

Graphs Comb., 2020

2019

Independence equivalence classes of paths and cycles.

Iain Beaton, Jason I. Brown, Ben Cameron

Australas. J Comb., 2019

The domination equivalence classes of paths.

Iain Beaton, Jason I. Brown

Australas. J Comb., 2019

2013

Even time constraints on the watchman's walk.

Iain Beaton, Rory Begin, Stephen Finbow, Christopher M. van Bommel

Australas. J Comb., 2013