The satisfactory partition problem (Q2495904): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2005.10.014
+Normal rank
@@ Property / OpenAlex ID @@
+W1982865350
@@ Property / OpenAlex ID: W1982865350 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+ON DISJOINT CYCLES
@@ Property / cites work: ON DISJOINT CYCLES / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic approach to the satisfactory graph partitioning problem
+Normal rank
@@ Property / cites work @@
+Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
+Normal rank
@@ Property / cites work @@
+Q4820779
@@ Property / cites work: Q4820779 / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+NP completeness of finding the chromatic index of regular graphs
+Normal rank
@@ Property / cites work @@
+Q4405794
@@ Property / cites work: Q4405794 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4715286
@@ Property / cites work: Q4715286 / rank @@
+Normal rank