An Optimal χ-Bound for (P6, diamond)-Free Graphs. - Kathie Cameron; Shenwei Huang; Owen D. Merkel (CoRR, 2018)

Reconstructing a Polyhedron between Polygons in Parallel Slices. - Therese Biedl; Pavle Bulatovic; Veronika Irvine; Anna Lubiw; Owen D. Merkel; Anurag Murty Naredla (CCCG, 2019)

Classes of Graphs with e-Positive Chromatic Symmetric Function. - Angèle M. Foley; Chính T. Hoàng; Owen D. Merkel (Electron. J. Comb., 2019)

Building a larger class of graphs for efficient reconfiguration of vertex colouring. - Therese Biedl; Anna Lubiw; Owen D. Merkel (CoRR, 2020)

Recolouring co-bipartite and weakly chordal graphs. - Owen D. Merkel (CoRR, 2021)

Mixing colourings in 2K2-free graphs. - Carl Feghali; Owen D. Merkel (CoRR, 2021)

An optimal χ -bound for ( P 6 , diamond)-free graphs. - Kathie Cameron; Shenwei Huang; Owen D. Merkel (J. Graph Theory, 2021)

Mixing colourings in 2K2-free graphs. - Carl Feghali; Owen D. Merkel (Discret. Math., 2022)

Recolouring weakly chordal graphs and the complement of triangle-free graphs. - Owen D. Merkel (Discret. Math., 2022)

Colouring graphs with no induced six-vertex path or diamond. - Jan Goedgebeur; Shenwei Huang; Yiao Ju; Owen D. Merkel (Theor. Comput. Sci., 2023)

Reconfiguration of vertex colouring and forbidden induced subgraphs. - Manoj M. Belavadi; Kathie Cameron; Owen D. Merkel (Eur. J. Comb., 2024)