6 citations · 6 across the 6 of their papers we have counts for
6 papers · 1 filter
Reconfiguration of vertex colouring and forbidden induced subgraphs
Manoj Belavadi, Kathie Cameron, Owen Merkel
The reconfiguration graph of the -colourings, denoted , is the graph whose vertices are the -colourings of and two colourings are adjacent in $\mathcal{…
Mixing colourings in -free graphs
Carl Feghali, Owen Merkel
The reconfiguration graph for the -colourings of a graph , denoted , is the graph whose vertices are the -colourings of and two colourings are joined by an e…
Recolouring weakly chordal graphs and the complement of triangle-free graphs
Owen Merkel
For a graph , the -recolouring graph is the graph whose vertices are the -colourings of and two colourings are joined by an edge if they differ in c…
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 (, diamond)-free if it contains no induced subgraph isomorphic to a six…
An Optimal -Bound for (, diamond)-Free Graphs
Kathie Cameron, Shenwei Huang, Owen Merkel
Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to or . Let be the path on vertices and b…
Classes of graphs with e-positive chromatic symmetric function
Angèle M. Foley, Chính T. Hoàng, Owen D. Merkel
In the mid-1990s, Stanley and Stembridge conjectured that the chromatic symmetric functions of claw-free co-comparability (also called incomparability) graphs were e-positive. The…