Dallas J. Fraser

most citedA Coloring Algorithm for

4 K_{1}

-free line graphs

2 citations · 2 across the 1 of their papers we have counts for

collaborators

2 papers

cs.DM2019

The intersection of two vertex coloring problems

Angele M. Foley, Dallas J. Fraser, Chinh T. Hoang +2

A hole is an induced cycle with at least four vertices. A hole is even if its number of vertices is even. Given a set L of graphs, a graph G is L-free if G does not contain any gra…

math.CO2015★ 2 cited

A Coloring Algorithm for $4 K_{1}$ -free line graphs

Dallas J. Fraser, Angèle M. Hamel, Chính T. Hoàng

Let $L$ be a set of graphs. $F r ee$ ( $L$ ) is the set of graphs that do not contain any graph in $L$ as an induced subgraph. It is known that if $L$ is a set of four-vertex graphs, th…

The intersection of two vertex coloring problems

A Coloring Algorithm for 4K1​-free line graphs

A Coloring Algorithm for $4 K_{1}$ -free line graphs