research
∙
09/17/2023
Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
A Hamiltonian path (a Hamiltonian cycle) in a graph is a path (a cycle, ...
share
research
∙
08/29/2023
The Parametrized Complexity of the Segment Number
Given a straight-line drawing of a graph, a segment is a maximal set of ...
research
∙
06/12/2023
Three Edge-disjoint Plane Spanning Paths in a Point Set
We study the following problem: Given a set S of n points in the plane, ...
research
∙
06/10/2023
Computational Complexity of Covering Disconnected Multigraphs
The notion of graph covers is a discretization of covering spaces introd...
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...
research
∙
04/08/2022
List covering of regular multigraphs
A graph covering projection, also known as a locally bijective homomorph...
research
∙
03/28/2021
Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges
We initiate the study of computational complexity of graph coverings, ak...
research
∙
02/19/2020