1 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.DM2012★ 1 cited
On List Colouring and List Homomorphism of Permutation and Interval Graphs
Jessica Enright, Lorna Stewart, Gabor Tardos
List colouring is an NP-complete decision problem even if the total number of colours is three. It is hard even on planar bipartite graphs. We give a polynomial-time algorithm for…
cs.DM2010★ 1 cited
The overlap number of a graph
Bill Rosgen, Lorna Stewart
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The ove…