Publications
- Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)2023 | Faculty of Mathematics and Physics
- A Relaxed Version of Šoltés's Problem and Cactus Graphs2021 | Faculty of Mathematics and Physics
- On relaxed Šoltés's problem2019 | Faculty of Mathematics and Physics
- List homomorphism problems for signed trees2023 | Faculty of Mathematics and Physics
- Min Orderings and List Homomorphism Dichotomies for Signed and Unsigned Graphs2022 | Faculty of Mathematics and Physics
- List Covering of Regular Multigraphs2022 | Faculty of Mathematics and Physics
- Computational Complexity of Covering Disconnected Multigraphs2021 | Faculty of Mathematics and Physics
- Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases2021 | Faculty of Mathematics and Physics
- Injective Colouring for H-Free Graphs2021 | Faculty of Mathematics and Physics
- Edge-sum distinguishing labeling2021 | Faculty of Mathematics and Physics
Loading network view...