Edge dominating set and colorings on graphs with fixed clique-width (Q1861574): Difference between revisions

@@ Property / cites work @@
+NP-completeness of edge-colouring some restricted graphs
+Normal rank
@@ Property / cites work @@
+Q4508369
@@ Property / cites work: Q4508369 / rank @@
+Normal rank
@@ Property / cites work @@
+Handle-rewriting hypergraph grammars
@@ Property / cites work: Handle-rewriting hypergraph grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
+Normal rank
@@ Property / cites work @@
+Upper bounds to the clique width of graphs
@@ Property / cites work: Upper bounds to the clique width of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Feasible edge colorings of trees with cardinality constraints
+Normal rank
@@ Property / cites work @@
+Restrictions and preassignments in preemptive open shop scheduling
+Normal rank
@@ Property / cites work @@
+Q3922703
@@ Property / cites work: Q3922703 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3691778
@@ Property / cites work: Q3691778 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3691779
@@ Property / cites work: Q3691779 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
+Normal rank
@@ Property / cites work @@
+ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES
@@ Property / cites work: ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES / 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 @@
+Q4489221
@@ Property / cites work: Q4489221 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2768335
@@ Property / cites work: Q2768335 / rank @@
+Normal rank
@@ Property / cites work @@
+Some results concerning the complexity of restricted colorings of graphs
+Normal rank
@@ Property / cites work @@
+Q4283244
@@ Property / cites work: Q4283244 / rank @@
+Normal rank
@@ Property / cites work @@
+ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P<sub>4</sub>'S
+Normal rank
@@ Property / cites work @@
+Algorithms for Vertex Partitioning Problems on Partial k-Trees
+Normal rank
@@ Property / cites work @@
+Graph colorings with local constraints -- a survey
+Normal rank
@@ Property / cites work @@
+\(k\)-NLC graphs and polynomial algorithms
@@ Property / cites work: \(k\)-NLC graphs and polynomial algorithms / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0166-218x(02)00198-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2070790034
@@ Property / OpenAlex ID: W2070790034 / rank @@
+Normal rank