research
∙
12/22/2021
Recognising the overlap graphs of subtrees of restricted trees is hard
The overlap graphs of subtrees in a tree (SOGs) generalise many other gr...
share
research
∙
12/21/2021
What Makes the Recognition Problem Hard for Classes Related to Segment and String graphs?
We explore what could make recognition of particular intersection-define...
research
∙
02/06/2020
On flips in planar matchings
In this paper we investigate the structure of a flip graph on non-crossi...
research
∙
11/14/2017