1 citations · 3 across the 5 of their papers we have counts for
5 papers · 1 filter
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…
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…
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…
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…
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…