Extremal graphs having no matching cuts (Q3113291): Difference between revisions

@@ Property / cites work @@
+The complexity of the matching-cut problem for planar graphs and other graph classes
+Normal rank
@@ Property / cites work @@
+A Note on Primitive Graphs
@@ Property / cites work: A Note on Primitive Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Recognizing decomposable graphs
@@ Property / cites work: Recognizing decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3337498
@@ Property / cites work: Q3337498 / rank @@
+Normal rank
@@ Property / cites work @@
+ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS
+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 @@
+On simple characterizations of k-trees
@@ Property / cites work: On simple characterizations of k-trees / rank @@
+Normal rank