Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract). - Jan Bok; Jirí Fiala 001; Nikola Jedlicková; Jan Kratochvíl; Michaela Seifrtová (WG, 2023)

Computational complexity of covering disconnected multigraphs. - Jan Bok; Jirí Fiala 001; Nikola Jedlicková; Jan Kratochvíl; Michaela Seifrtová (Discret. Appl. Math., 2024)

Decycling cubic graphs. - Roman Nedela; Michaela Seifrtová; Martin Skoviera (Discret. Math., 2024)

A novel approach to covers of multigraphs with semi-edges. - Jirí Fiala 001; Michaela Seifrtová (Discuss. Math. Graph Theory, 2025)

Precoloring extension in planar near-Eulerian-triangulations. - Zdenek Dvorák 001; Benjamin R. Moore; Michaela Seifrtová; Robert Sámal (Eur. J. Comb., 2025)

Computational Complexity of Covering Colored Mixed Multigraphs with Simple Degree Partitions. - Jan Bok; Jirí Fiala 001; Nikola Jedlicková; Jan Kratochvíl; Michaela Seifrtová (CoRR, 2025)