About me

I am a PhD student at the Department of Applied Mathematics of the Faculty of Mathematics and Physics at the Charles University. My supervisor is Professor Jan Kratochvíl.

Research interests

• Graph homomorphisms, colourings, and labellings
• Hamiltonian Path and Cycle problem and their generalization
• Computational complexity of graph problems
• Structural aspects of special graph classes

Contact

You can contact me by email at jedlickova@kam.mff.cuni.cz

Publications

The publications are ordered from newest to oldest. Last updated May 2024.

1. Nikola Jedličková and Jan Kratochvíl:
   On the Structure of Hamiltonian Graphs with Small Independence Number.
   Accepted to IWOCA, 2024. [arXiv]

2. Nikola Jedličková and Jan Kratochvíl:
   Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number.
   [arXiv]

3. Jan Bok, Jiří Fiala, Nikola Jedličková, Jan Kratochvíl, and Paweł Rzążewski:
   List covering of regular multigraphs with semi-edges.
   Algorithmica, 86:782--807, 2024. [DOI], [arXiv]

4. Jan Bok, Jiří Fiala, Petr Hliněný, Nikola Jedličková, and Jan Kratochvíl:
   Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases.
   Submitted, 2023.

5. Jan Bok, Jiří Fiala, Nikola Jedličková, Jan Kratochvíl, and Michaela Seifrtová:
   Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two.
   In Graph-Theoretic Concepts in Computer Science, WG 2023, volume 14093 of Lecture Notes in Computer Science, pages 101-115, 2023. [DOI]

6. Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, and Nikola Jedličková:
   List homomorphisms to separable signed graphs.
   Accepted to Theoretical Computer Science, 2024. [arXiv]

7. Jan Bok, Richard C. Brewster, Nikola Jedličková, Pavol Hell, and Arash Rafiey:
   Min orderings and list homomorphism dichotomies for signed and unsigned graphs.
   Submitted, 2023. [arXiv]

8. Jan Bok, Jiří Fiala, Nikola Jedličková, Jan Kratochvíl, and Michaela Seifrtová:
   Computational Complexity of Covering Disconnected Multigraphs.
   Submitted, 2023. [arXiv]

9. Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, and Nikola Jedličková:
   List homomorphism problems for signed trees.
   Discrete Mathematics, 346(3):113257, 2023. [arXiv]

10. Jan Bok, Richard C. Brewster, Nikola Jedličková, Pavol Hell, and Arash Rafiey:
    Min orderings and list homomorphism dichotomies for signed and unsigned graphs.
    In LATIN 2022: Theoretical Informatics - 15th Latin American Symposium, volume 13568 of Lecture Notes in Computer Science, pages 510–526, 2022. [DOI]

11. Jan Bok, Jiří Fiala, Nikola Jedličková, Jan Kratochvíl, and Paweł Rzążewski:
    List covering of regular multigraphs.
    In Combinatorial Algorithms - 33rd International Workshop, IWOCA 2022, volume 13270 of Lecture Notes in Computer Science, pages 228–242, 2022. [DOI]

12. Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, and Nikola Jedličková:
    List homomorphisms to separable signed graphs.
    In Algorithms and Discrete Applied Mathematics - 8th International Conference, CALDAM 2022, volume 13179 of Lecture Notes in Computer Science, pages 22–35, 2022. [DOI]

13. Jan Bok, Jiří Fiala, Nikola Jedličková, Jan Kratochvíl, and Michaela Seifrtová:
    Computational Complexity of Covering Disconnected Multigraphs.
    In Fundamentals of Computation Theory, FCT 2021, volume 12867 of Lecture Notes in Computer Science, pages 85–89, 2021.

14. Jan Bok, Jiří Fiala, Petr Hliněný, Nikola Jedličková, and Jan Kratochvíl:
    Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases.
    In 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, volume 202 of Leibniz International Proceedings in Informatics (LIPIcs), pages 21:1–21:15, 2021.

15. Jan Bok, and Nikola Jedličková:
    Edge-sum distinguishing labeling.
    Commentationes Mathematicae Universitatis Carolinae 62(2):135–149, 2021.

16. Jan Bok, Nikola Jedličková, Barnaby Martin, Pascal Ochem, Daniël Paulusma, and Siani Smith:
    Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs.
    Submitted, 2021. [arXiv]

17. Jan Bok, Nikola Jedličková, Barnaby Martin, Daniël Paulusma, and Siani Smith:
    Injective Colouring for H-Free Graphs.
    In Computer Science – Theory and Applications, CSR 2021, volume 12730 of Lecture Notes in Computer Science, pages 18–30, 2021. [DOI]

18. Jan Bok, Nikola Jedličková, and Jana Maxová:
    A Relaxed Version of Šoltés’s Problem and Cactus Graphs.
    Bulletin of the Malaysian Mathematical Sciences Society, 44:3733–-3745, 2021. [DOI]

19. Jan Bok, Richard C. Brewster, Tomás Feder, Nikola Jedličková, and Pavol Hell:
    List Homomorphism Problems for Signed Graphs.
    In 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, volume 170 of Leibniz International Proceedings in Informatics (LIPIcs), pages 170:20:1–20:14, 2020.

20. Jan Bok, Nikola Jedličková, Barnaby Martin, Daniël Paulusma, and Siani Smith:
    Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs.
    In 28th Annual European Symposium on Algorithms, ESA 2020, volume 173 of Leibniz International Proceedings in Informatics (LIPIcs), pages 173:22:1–22:22, 2020.

21. Jan Bok, Nikola Jedličková, and Jana Maxová:
    On relaxed Šoltés’s problem.
    Acta Mathematica Universitatis Comenianae 88(3):475–480, 2019.

22. Jan Bok, Boris Furtula, Nikola Jedličková, and Riste Škrekovski:
    On Extremal Graphs of Weighted Szeged Index.
    MATCH 82(1):93–109, 2019.