Nikola Jedlicková

According to our database, Nikola Jedlicková authored at least 18 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

List Covering of Regular Multigraphs with Semi-edges.

Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski

Algorithmica, March, 2024

On the Structure of Hamiltonian Graphs with Small Independence Number.

Nikola Jedlicková, Jan Kratochvíl

CoRR, 2024

2023

List homomorphism problems for signed trees.

Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková

Discret. Math., 2023

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number.

Nikola Jedlicková, Jan Kratochvíl

CoRR, 2023

Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract).

Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

2022

Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs.

Jan Bok, Richard C. Brewster, Pavol Hell, Nikola Jedlicková, Arash Rafiey

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

List Covering of Regular Multigraphs.

Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Pawel Rzazewski

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

List Homomorphisms to Separable Signed Graphs.

Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková

Proceedings of the Algorithms and Discrete Applied Mathematics, 2022

2021

Computational Complexity of Covering Two-vertex Multigraphs with Semi-edges.

Jan Bok, Jirí Fiala, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl

CoRR, 2021

Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases.

Jan Bok, Jirí Fiala, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Computational Complexity of Covering Disconnected Multigraphs.

Jan Bok, Jirí Fiala, Nikola Jedlicková, Jan Kratochvíl, Michaela Seifrtová

Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

Injective Colouring for H-Free Graphs.

Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith

Proceedings of the Computer Science - Theory and Applications, 2021

2020

List Homomorphism Problems for Signed Graphs.

Jan Bok, Richard C. Brewster, Tomás Feder, Pavol Hell, Nikola Jedlicková

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs.

Jan Bok, Nikola Jedlicková, Barnaby Martin, Daniël Paulusma, Siani Smith

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019

A relaxed version of Šoltés's problem and cactus graphs.

Jan Bok, Nikola Jedlicková, Jana Maxová

CoRR, 2019

On Extremal Graphs of Weighted Szeged Index.

Jan Bok, Boris Furtula, Nikola Jedlicková, Riste Skrekovski

CoRR, 2019

2018

A note on simultaneous representation problem for interval and circular-arc graphs.

Jan Bok, Nikola Jedlicková

CoRR, 2018

Edge-sum distinguishing labeling.

Jan Bok, Nikola Jedlicková

CoRR, 2018