research
∙
12/11/2022
Beyond circular-arc graphs – recognizing lollipop graphs and medusa graphs
In 1992 Biró, Hujter and Tuza introduced, for every fixed connected grap...
share
research
∙
08/12/2021
Grounded L-graphs are polynomially χ-bounded
A grounded L-graph is the intersection graph of a collection of "L" shap...
research
∙
03/13/2021
Colouring polygon visibility graphs and their generalizations
Curve pseudo-visibility graphs generalize polygon and pseudo-polygon vis...
research
∙
10/22/2020
Vertex deletion into bipartite permutation graphs
A permutation graph can be defined as an intersection graph of segments ...
research
∙
04/09/2019
Testing isomorphism of circular-arc graphs -- Hsu's approach revisited
Circular-arc graphs are intersection graphs of arcs on the circle. The a...
research
∙
09/29/2018
