Owen D. Merkel

activity

20182022

most citedReconfiguration of vertex colouring and forbidden induced subgraphs

6 citations · 6 across the 6 of their papers we have counts for

collaborators

Showing 2021Show all

3 papers · 1 filter

math.CO2021

Mixing colourings in $2 K_{2}$ -free graphs

Carl Feghali, Owen Merkel

The reconfiguration graph for the $k$ -colourings of a graph $G$ , denoted $R_{k} (G)$ , is the graph whose vertices are the $k$ -colourings of $G$ and two colourings are joined by an e…

math.CO2021

Recolouring weakly chordal graphs and the complement of triangle-free graphs

Owen Merkel

For a graph $G$ , the $k$ -recolouring graph $R_{k} (G)$ is the graph whose vertices are the $k$ -colourings of $G$ and two colourings are joined by an edge if they differ in c…

math.CO2021

Colouring graphs with no induced six-vertex path or diamond

Jan Goedgebeur, Shenwei Huang, Yiao Ju +1

The diamond is the graph obtained by removing an edge from the complete graph on 4 vertices. A graph is ( $P_{6}$ , diamond)-free if it contains no induced subgraph isomorphic to a six…

Mixing colourings in 2K2​-free graphs

Recolouring weakly chordal graphs and the complement of triangle-free graphs

Colouring graphs with no induced six-vertex path or diamond

Mixing colourings in $2 K_{2}$ -free graphs