Finding matching cuts in \(H\)-free graphs (Q6046951): 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 @@
+Vertex partitioning problems on graphs with bounded tree width
+Normal rank
@@ Property / cites work @@
+An FPT algorithm for matching cut and d-cut
@@ Property / cites work: An FPT algorithm for matching cut and d-cut / rank @@
+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 @@
+A new characterization of \(P_k\)-free graphs
@@ Property / cites work: A new characterization of \(P_k\)-free graphs / rank @@
+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 @@
+The structure of bull-free graphs II and III -- a summary
+Normal rank
@@ Property / cites work @@
+Q3416248
@@ Property / cites work: Q3416248 / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing decomposable graphs
@@ Property / cites work: Recognizing decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-width for hereditary graph classes
@@ Property / cites work: Clique-width for hereditary graph classes / rank @@
+Normal rank
@@ Property / cites work @@
+Disconnected 2-factors in planar cubic bridgeless graphs
+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 @@
+A note on matching-cut in \(P_t\)-free graphs
@@ Property / cites work: A note on matching-cut in \(P_t\)-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+-factor Hamiltonian graphs.
@@ Property / cites work: 2-factor Hamiltonian graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs
+Normal rank
@@ Property / cites work @@
+Refined notions of parameterized enumeration kernels with applications to matching cut enumeration
+Normal rank
@@ Property / cites work @@
+Computing vertex-surjective homomorphisms to partially reflexive trees
+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 @@
+Q4209364
@@ Property / cites work: Q4209364 / rank @@
+Normal rank
@@ Property / cites work @@
+Domination When the Stars Are Out
@@ Property / cites work: Domination When the Stars Are Out / rank @@
+Normal rank
@@ Property / cites work @@
+Contracting to a longest path in H-free graphs
@@ Property / cites work: Contracting to a longest path in H-free graphs / rank @@
+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 @@
+The perfect matching cut problem revisited
@@ Property / cites work: The perfect matching cut problem revisited / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs
+Normal rank
@@ Property / cites work @@
+Hard problems that quickly become very easy
@@ Property / cites work: Hard problems that quickly become very easy / 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 @@
+Vertex colouring and forbidden subgraphs -- a survey
+Normal rank
@@ Property / cites work @@
+A new characterization of \(P_{6}\)-free graphs
@@ Property / cites work: A new characterization of \(P_{6}\)-free graphs / rank @@
+Normal rank