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

Jan Bok, Jirí Fiala 0001, Petr Hlinený, Nikola Jedlicková, Jan Kratochvíl. Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases. In Filippo Bonchi, Simon J. Puglisi, editors, 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia. Volume 202 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. [doi]

@inproceedings{Bok0HJK21,
  title = {Computational Complexity of Covering Multigraphs with Semi-Edges: Small Cases},
  author = {Jan Bok and Jirí Fiala 0001 and Petr Hlinený and Nikola Jedlicková and Jan Kratochvíl},
  year = {2021},
  doi = {10.4230/LIPIcs.MFCS.2021.21},
  url = {https://doi.org/10.4230/LIPIcs.MFCS.2021.21},
  researchr = {https://researchr.org/publication/Bok0HJK21},
  cites = {0},
  citedby = {0},
  booktitle = {46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021, August 23-27, 2021, Tallinn, Estonia},
  editor = {Filippo Bonchi and Simon J. Puglisi},
  volume = {202},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  isbn = {978-3-95977-201-3},
}