Partitioning chordal graphs into independent sets and cliques (Q1827861): Difference between revisions

@@ Property / cites work @@
+Extending graph colorings
@@ Property / cites work: Extending graph colorings / rank @@
+Normal rank
@@ Property / cites work @@
+Partitions of graphs into one or two independent sets and cliques
+Normal rank
@@ Property / cites work @@
+The complexity of some problems related to GRAPH 3-COLORABILITY
+Normal rank
@@ Property / cites work @@
+\(r\)-dominating cliques in graphs with hypertree structure
+Normal rank
@@ Property / cites work @@
+Complexity of graph partition problems
@@ Property / cites work: Complexity of graph partition problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4193514
@@ Property / cites work: Q4193514 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2741477
@@ Property / cites work: Q2741477 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4344207
@@ Property / cites work: Q4344207 / rank @@
+Normal rank