Owen D. Merkel

14 papers Misc 1Journal 12Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
Reconfiguration of vertex colouring and forbidden induced subgraphs.
Eur. J. Comb.
Manoj M. Belavadi, Kathie Cameron, Owen D. Merkel
2023 J jnl
Colouring graphs with no induced six-vertex path or diamond.
Theor. Comput. Sci.
Jan Goedgebeur, Shenwei Huang, Yiao Ju, Owen D. Merkel
2022 J jnl
Mixing colourings in 2
Discret. Math.
Carl Feghali, Owen D. Merkel
2022 J jnl
Recolouring weakly chordal graphs and the complement of triangle-free graphs.
Discret. Math.
Owen D. Merkel
2021 J jnl
An optimal χ -bound for ( P 6 , diamond)-free graphs.
J. Graph Theory
Kathie Cameron, Shenwei Huang, Owen D. Merkel
2021 Misc conf
Colouring Graphs with No Induced Six-Vertex Path or Diamond.
COCOON
Jan Goedgebeur, Shenwei Huang, Yiao Ju, Owen D. Merkel
2021 J jnl
Colouring graphs with no induced six-vertex path or diamond.
CoRR
Jan Goedgebeur, Shenwei Huang, Yiao Ju, Owen D. Merkel
2021 J jnl
Mixing colourings in 2K
CoRR
Carl Feghali, Owen D. Merkel
2021 J jnl
Recolouring co-bipartite and weakly chordal graphs.
CoRR
Owen D. Merkel
2020 J jnl
Building a larger class of graphs for efficient reconfiguration of vertex colouring.
CoRR
Therese Biedl, Anna Lubiw, Owen D. Merkel
2020 J jnl
Reconstructing a Polyhedron between Polygons in Parallel Slices.
CoRR
Therese Biedl, Pavle Bulatovic, Veronika Irvine, Anna Lubiw, Owen D. Merkel, Anurag Murty Naredla
2019 J jnl
Classes of Graphs with e-Positive Chromatic Symmetric Function.
Electron. J. Comb.
Angèle M. Foley, Chính T. Hoàng, Owen D. Merkel
2019 — conf
Reconstructing a Polyhedron between Polygons in Parallel Slices.
CCCG
Therese Biedl, Pavle Bulatovic, Veronika Irvine, Anna Lubiw, Owen D. Merkel, Anurag Murty Naredla
2018 J jnl
An Optimal χ-Bound for (P
CoRR
Kathie Cameron, Shenwei Huang, Owen D. Merkel