Jedličková, Nikola

1. Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective
   2024/03/09 by Fomin, Fedor V., Golovach, Petr A., Jedličková, Nikola +3 · 2 citations
   #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
2. Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
   2023/09/17 by Nikola Jedličková, Jan Kratochvı́l, Jedličková, Nikola +1 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #semigroups and automata theory