Computational complexity of covering disconnected multigraphs (Q2140489): Difference between revisions

@@ Property / author @@
+Jiří Fiala
@@ Property / author: Jiří Fiala / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-030-86593-1_6
+Normal rank
@@ Property / OpenAlex ID @@
+W3199562110
@@ Property / OpenAlex ID: W3199562110 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4017175
@@ Property / cites work: Q4017175 / rank @@
+Normal rank
@@ Property / cites work @@
+Algebraic Graph Theory
@@ Property / cites work: Algebraic Graph Theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q3416074
@@ Property / cites work: Q3416074 / rank @@
+Normal rank
@@ Property / cites work @@
+Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree
+Normal rank
@@ Property / cites work @@
+Complexity of graph covering problems
@@ Property / cites work: Complexity of graph covering problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4373685
@@ Property / cites work: Q4373685 / rank @@
+Normal rank
@@ Property / cites work @@
+Lifting graph automorphisms by voltage assignments
+Normal rank
@@ Property / cites work @@
+Q4389332
@@ Property / cites work: Q4389332 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2810314
@@ Property / cites work: Q2810314 / rank @@
+Normal rank