Computational complexity of covering disconnected multigraphs
From MaRDI portal
Publication:2140489
DOI10.1007/978-3-030-86593-1_6OpenAlexW3199562110MaRDI QIDQ2140489
Jan Kratochvíl, Nikola Jedličková, Jan Bok, Michaela Seifrtová, Jiří Fiala
Publication date: 20 May 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-86593-1_6
Related Items
List covering of regular multigraphs ⋮ An algorithmic framework for locally constrained homomorphisms ⋮ Graph covers: where topology meets computer science, and simple means difficult ⋮ List covering of regular multigraphs with semi-edges
Cites Work