Computational complexity of covering disconnected multigraphs
From MaRDI portal
Publication:2140489
Cites work
- scientific article; zbMATH DE number 91031 (Why is no real title available?)
- scientific article; zbMATH DE number 1107736 (Why is no real title available?)
- scientific article; zbMATH DE number 1151379 (Why is no real title available?)
- Algebraic Graph Theory
- Complexity of graph covering problems
- Harmonic morphisms of graphs. Part I: Graph coverings
- Lifting graph automorphisms by voltage assignments
- Local computations in graphs: the case of cellular edge local computations
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
Cited in
(12)- scientific article; zbMATH DE number 1236360 (Why is no real title available?)
- Graph covers: where topology meets computer science, and simple means difficult
- scientific article; zbMATH DE number 7724194 (Why is no real title available?)
- An algorithmic framework for locally constrained homomorphisms
- The complexity of dissociation set problems in graphs
- List covering of regular multigraphs
- An algorithmic framework for locally constrained homomorphisms
- Computational Complexity of Covering Disconnected Multigraphs
- 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
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)
