Matching cut in graphs with large minimum degree (Q5925521): Difference between revisions

@@ Property / cites work @@
+Good edge-labelling of graphs
@@ Property / cites work: Good edge-labelling of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On structural parameterizations of the matching cut problem
+Normal rank
@@ Property / cites work @@
+The complexity of the matching-cut problem for planar graphs and other graph classes
+Normal rank
@@ Property / cites work @@
+Matching cutsets in graphs of diameter 2
@@ Property / cites work: Matching cutsets in graphs of diameter 2 / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing decomposable graphs
@@ Property / cites work: Recognizing decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Networks immune to isolated line failures
@@ Property / cites work: Networks immune to isolated line failures / rank @@
+Normal rank
@@ Property / cites work @@
+Exact exponential algorithms.
@@ Property / cites work: Exact exponential algorithms. / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization
+Normal rank
@@ Property / cites work @@
+ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS
+Normal rank
@@ Property / cites work @@
+Matching cut in graphs with large minimum degree
@@ Property / cites work: Matching cut in graphs with large minimum degree / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms
+Normal rank
@@ Property / cites work @@
+Algorithms solving the matching cut problem
@@ Property / cites work: Algorithms solving the matching cut problem / rank @@
+Normal rank
@@ Property / cites work @@
+A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter
+Normal rank
@@ Property / cites work @@
+On stable cutsets in line graphs
@@ Property / cites work: On stable cutsets in line graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Matching cutsets in graphs
@@ Property / cites work: Matching cutsets in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4448767
@@ Property / cites work: Q4448767 / rank @@
+Normal rank
@@ Property / cites work @@
+Forbidden subgraph decomposition
@@ Property / cites work: Forbidden subgraph decomposition / rank @@
+Normal rank
@@ Property / cites work @@
+Partition into triangles on bounded degree graphs
@@ Property / cites work: Partition into triangles on bounded degree graphs / rank @@
+Normal rank