Computational complexity of covering disconnected multigraphs
From MaRDI portal
Publication:2140489
DOI10.1007/978-3-030-86593-1_6OpenAlexW3199562110MaRDI QIDQ2140489FDOQ2140489
Authors: Jan Bok, Nikola Jedličková, Jan Kratochvíl, 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
Cites Work
- Algebraic Graph Theory
- Lifting graph automorphisms by voltage assignments
- Local computations in graphs: the case of cellular edge local computations
- Harmonic morphisms of graphs. Part I: Graph coverings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Complexity of graph covering problems
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
Cited In (12)
- Graph covers: where topology meets computer science, and simple means difficult
- Title not available (Why is that?)
- An algorithmic framework for locally constrained homomorphisms
- The complexity of dissociation set problems in graphs
- Computational Complexity of Covering Disconnected Multigraphs
- List covering of regular multigraphs
- An algorithmic framework for locally constrained homomorphisms
- Computational Complexity of Covering Colored Mixed Multigraphs with Degree Partition Equivalence Classes of Size at Most Two (Extended Abstract)
- Computational complexity of covering disconnected multigraphs
- Computational complexity of covering cyclic graphs
- List covering of regular multigraphs with semi-edges
- Title not available (Why is that?)
This page was built for publication: Computational complexity of covering disconnected multigraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140489)
