activity
20092015
most citedThe overlap number of a graph

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

collaborators

6 papers

cs.DM2015★ 1 cited

Equivalence of the filament and overlap graphs of subtrees of limited trees

Jessica Enright, Lorna Stewart

The overlap graphs of subtrees of a tree are equivalent to subtree filament graphs, the overlap graphs of subtrees of a star are cocomparability graphs, and the overlap graphs of s…

cs.DM2014

On polygon numbers of circle graphs and distance hereditary graphs

Lorna Stewart, Richard Anthony Valenzano

Circle graphs are intersection graphs of chords in a circle and -polygon graphs are intersection graphs of chords in a convex -sided polygon where each chord has its endpoint…

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.DM2011

3-List Colouring Permutation Graphs

Jessica Enright, Lorna Stewart

3-list colouring is an NP-complete decision problem. It is hard even on planar bipartite graphs. We give a polynomial-time algorithm for solving 3-list colouring on permutation gra…

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…

cs.CC2009

On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two

Elaine M. Eschen, Chinh T. Hoang, R. Sritharan +1

In an article [3] published recently in this journal, it was shown that when k >= 3, the problem of deciding whether the distinguishing chromatic number of a graph is at most k is…