Characterizing –partitionable Cographs (Q3439349): Difference between revisions

@@ Property / author @@
+Loana Tito Nogueira
@@ Property / author: Loana Tito Nogueira / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2005.06.052
+Normal rank
@@ Property / OpenAlex ID @@
+W2084299532
@@ Property / OpenAlex ID: W2084299532 / 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 @@
+Complexity of graph partition problems
@@ Property / cites work: Complexity of graph partition problems / rank @@
+Normal rank
@@ Property / cites work @@
+Partitioning chordal graphs into independent sets and cliques
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank