2 citations · 2 across the 5 of their papers we have counts for
5 papers
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…
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…
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…
On the Structure of Hamiltonian Graphs with Small Independence Number
Nikola Jedličková, Jan Kratochvíl
A Hamiltonian path (cycle) in a graph is a path (cycle, respectively) which passes through all of its vertices. The problems of deciding the existence of a Hamiltonian cycle (path)…
On a Combinatorial Problem Arising in Machine Teaching
Brigt Håvardstun, Jan Kratochvíl, Joakim Sunde +1
We study a model of machine teaching where the teacher mapping is constructed from a size function on both concepts and examples. The main question in machine teaching is the minim…