The complexity of partitioning into disjoint cliques and a triangle-free graph (Q516874): Difference between revisions

@@ Property / OpenAlex ID @@
+W2963676992
@@ Property / OpenAlex ID: W2963676992 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.02207
@@ Property / arXiv ID: 1512.02207 / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning a graph into disjoint cliques and a triangle-free graph
+Normal rank
@@ Property / cites work @@
+Q2743189
@@ Property / cites work: Q2743189 / rank @@
+Normal rank
@@ Property / cites work @@
+The structure of bull-free graphs II and III -- a summary
+Normal rank
@@ Property / cites work @@
+Dynamic cage survey
@@ Property / cites work: Dynamic cage survey / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard
+Normal rank
@@ Property / cites work @@
+A special planar satisfiability problem and a consequence of its NP- completeness
+Normal rank
@@ Property / cites work @@
+Q5530470
@@ Property / cites work: Q5530470 / rank @@
+Normal rank
@@ Property / cites work @@
+Colorings and girth of oriented planar graphs
@@ Property / cites work: Colorings and girth of oriented planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Paw-free graphs
@@ Property / cites work: Paw-free graphs / rank @@
+Normal rank