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 2018Show all

2 papers · 1 filter

math.CO2018

An Optimal $χ$ -Bound for ( $P_{6}$ , diamond)-Free Graphs

Kathie Cameron, Shenwei Huang, Owen Merkel

Given two graphs $H_{1}$ and $H_{2}$ , a graph $G$ is $(H_{1}, H_{2})$ -free if it contains no induced subgraph isomorphic to $H_{1}$ or $H_{2}$ . Let $P_{t}$ be the path on $t$ vertices and $K_{t}$ b…

math.CO2018

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…

An Optimal χ-Bound for (P6​, diamond)-Free Graphs

Classes of graphs with e-positive chromatic symmetric function

An Optimal $χ$ -Bound for ( $P_{6}$ , diamond)-Free Graphs