Reconfiguration of Vertex Covers in a Graph (Q2946052): Difference between revisions

@@ 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-319-19315-1_15
+Normal rank
@@ Property / OpenAlex ID @@
+W1156529421
@@ Property / OpenAlex ID: W1156529421 / rank @@
+Normal rank
@@ Property / cites work @@
+Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
+Normal rank
@@ Property / cites work @@
+Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Even-hole-free graphs part I: Decomposition theorem
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
+Normal rank
@@ Property / cites work @@
+PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
+Normal rank
@@ Property / cites work @@
+On the complexity of reconfiguration problems
@@ Property / cites work: On the complexity of reconfiguration problems / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of independent set reconfigurability problems
+Normal rank
@@ Property / cites work @@
+Vertex Cover Reconfiguration and Beyond
@@ Property / cites work: Vertex Cover Reconfiguration and Beyond / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of reconfiguration problems
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2946052