2 papers
math.CO2024
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)…
cs.DM2023
Computational Complexity of Covering Disconnected Multigraphs
Jan Bok, Jiří Fiala, Nikola Jedličková +2
The notion of graph covers is a discretization of covering spaces introduced and deeply studied in topology. In discrete mathematics and theoretical computer science, they have att…