K. Cameron

activity

20052025

most citedEdge Intersection Graphs of L-Shaped Paths in Grids

16 citations · 28 across the 10 of their papers we have counts for

collaborators

Showing 2018 · math.COShow all

2 papers · 2 filters

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

The class of $(P_{7}, C_{4}, C_{5})$ -free graphs: decomposition, algorithms, and $χ$ -boundedness

Kathie Cameron, Shenwei Huang, Irena Penev +1

As usual, $P_{n}$ ( $n \geq 1$ ) denotes the path on $n$ vertices, and $C_{n}$ ( $n \geq 3$ ) denotes the cycle on $n$ vertices. For a family $H$ of graphs, we say that a graph $…

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

The class of (P7​,C4​,C5​)-free graphs: decomposition, algorithms, and χ-boundedness

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

The class of $(P_{7}, C_{4}, C_{5})$ -free graphs: decomposition, algorithms, and $χ$ -boundedness