3 papers
cs.CG2025
Edge-Constrained Hamiltonian Paths on a Point Set
Todor AntiÄ, Aleksa Džuklevski, JiÅà Fiala +5
Let S be a set of distinct points in general position in the Euclidean plane. A plane Hamiltonian path on S is a crossing-free geometric path such that every point of S is a vertex…
math.CO2025
Graph covers and semi-covers: Who is stronger?
Jan Kratochvil, Roman Nedela
The notion of graph cover, also known as locally bijective homomorphism, is a discretization of covering spaces known from general topology. It is a pair of incidence-preserving ve…
cs.DM2025
Computational Complexity of Covering Colored Mixed Multigraphs with Simple Degree Partitions
Jan Bok, JiÅà Fiala, Nikola JedliÄková +2
The notion of graph covers (also referred to as locally bijective homomorphisms) plays an important role in topological graph theory and has found its computer science applications…