Nikola Jedlicková

Orcid: 0000-0001-9518-6386

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Min Orderings and List Homomorphism Dichotomies for Graphs and Signed Graphs.
Algorithmica, July, 2024

List Covering of Regular Multigraphs with Semi-edges.
Algorithmica, March, 2024

List homomorphisms to separable signed graphs.
Theor. Comput. Sci., 2024

Computational complexity of covering disconnected multigraphs.
Discret. Appl. Math., 2024

On the Structure of Hamiltonian Graphs with Small Independence Number.
Proceedings of the Combinatorial Algorithms - 35th International Workshop, 2024

2023
List homomorphism problems for signed trees.
Discret. Math., 2023

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

Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

2022
Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

List Covering of Regular Multigraphs.
Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

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

Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Injective Colouring for H-Free Graphs.
Proceedings of the Computer Science - Theory and Applications, 2021

2020
List Homomorphism Problems for Signed Graphs.
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.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

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

On Extremal Graphs of Weighted Szeged Index.
CoRR, 2019

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

Edge-sum distinguishing labeling.
CoRR, 2018


  Loading...