A dichotomy theorem for circular colouring reconfiguration. - Richard C. Brewster; Sean McGuinness; Benjamin R. Moore; Jonathan A. Noel (Theor. Comput. Sci., 2016)

Graph Homomorphism Reconfiguration and Frozen H-Colourings. - Richard C. Brewster; Jae-Baek Lee; Benjamin R. Moore; Jonathan A. Noel; Mark H. Siggers (CoRR, 2017)

Reconfiguration of Graph Minors. - Benjamin R. Moore; Naomi Nishimura; Vijay Subramanya (MFCS, 2018)

The pseudoforest analogue for the Strong Nine Dragon Tree Conjecture is true. - Logan Grout; Benjamin R. Moore (J. Comb. Theory B, 2020)

Graph homomorphism reconfiguration and frozen H-colorings. - Richard C. Brewster; Jae-Baek Lee; Benjamin R. Moore; Jonathan A. Noel; Mark H. Siggers (J. Graph Theory, 2020)

Reconfiguring spanning and induced subgraphs. - Tesshu Hanaka; Takehiro Ito; Haruka Mizuta; Benjamin R. Moore; Naomi Nishimura; Vijay Subramanya; Akira Suzuki 001; Krishna Vaidyanathan (Theor. Comput. Sci., 2020)

Cycles in Color-Critical Graphs. - Benjamin R. Moore; Douglas B. West (Electron. J. Comb., 2021)

Digraphs with All Induced Directed Cycles of the Same Length are not $ vec{ chi}$-Bounded. - Alvaro Carbonero; Patrick Hompe; Benjamin R. Moore; Sophie Spirkl (Electron. J. Comb., 2022)

Square roots of nearly planar graphs. - Zdenek Dvorák 001; Benjamin R. Moore; Abhiruk Lahiri (CoRR, 2022)

A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number. - Alvaro Carbonero; Patrick Hompe; Benjamin R. Moore; Sophie Spirkl (J. Comb. Theory B, 2023)

Local Hadwiger's Conjecture. - Benjamin R. Moore; Luke Postle; Lise Turner (J. Comb. Theory B, 2023)

Characterizing circular colouring mixing for p q 4 $ frac{p}{q} lt 4$. - Richard C. Brewster; Benjamin R. Moore (J. Graph Theory, 2023)

A density bound for triangle-free 4-critical graphs. - Benjamin R. Moore; Evelyne Smith-Roberge (J. Graph Theory, 2023)

The Strong Nine Dragon Tree Conjecture is True for $d le k + 1$. - Sebastian Mies; Benjamin R. Moore (Comb., 2023)

Decompositions into two linear forests of bounded lengths. - Rutger Campbell; Florian Hörsch; Benjamin R. Moore (Discret. Math., 2024)

Subchromatic numbers of powers of graphs with excluded minors. - Pedro P. Cortés; Pankaj Kumar; Benjamin R. Moore; Patrice Ossona de Mendez; Daniel A. Quiroz (Discret. Math., 2025)

On heroes in digraphs with forbidden induced forests. - Alvaro Carbonero; Hidde Koerts; Benjamin R. Moore; Sophie Spirkl (Eur. J. Comb., 2025)

Precoloring extension in planar near-Eulerian-triangulations. - Zdenek Dvorák 001; Benjamin R. Moore; Michaela Seifrtová; Robert Sámal (Eur. J. Comb., 2025)

Beyond the pseudoforest strong Nine Dragon Tree Theorem. - Sebastian Mies; Benjamin R. Moore; Evelyne Smith-Roberge (Eur. J. Comb., 2025)