research
∙
09/19/2022
Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours
In this paper, we study problems of connecting classes of points via non...
share
research
∙
09/28/2021
Generalising the achromatic number to Zaslavsky's colourings of signed graphs
The chromatic number, which refers to the minimum number of colours requ...
research
∙
01/15/2020
1-planar graphs with minimum degree at least 3 have bounded girth
We show that every 1-planar graph with minimum degree at least 4 has gir...
research
∙
05/07/2019
Graphs with the second and third maximum Wiener index over the 2-vertex connected graphs
Wiener index, defined as the sum of distances between all unordered pair...
research
∙
11/23/2017
