Independent domination in finitely defined classes of graphs: polynomial algorithms (Q2255037): Difference between revisions

@@ Property / cites work @@
+Augmenting graphs for independent sets
@@ Property / cites work: Augmenting graphs for independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+On algorithms for (\(P_5\), gem)-free graphs
@@ Property / cites work: On algorithms for (\(P_5\), gem)-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Independent domination in finitely defined classes of graphs
+Normal rank
@@ Property / cites work @@
+An augmenting graph approach to the stable set problem in \(P_{5}\)-free graphs
+Normal rank
@@ Property / cites work @@
+On independent vertex sets in subclasses of apple-free graphs
+Normal rank
@@ Property / cites work @@
+The weighted independent domination problem is NP-complete for chordal graphs
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+Domination in convex and chordal bipartite graphs
@@ Property / cites work: Domination in convex and chordal bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the vertex packing problem
@@ Property / cites work: On the vertex packing problem / rank @@
+Normal rank
@@ Property / cites work @@
+An O(n2) Divide-and-Conquer Algorithm for the Prime Tree Decomposition of Two-Structures and Modular Decomposition of Graphs
+Normal rank
@@ Property / cites work @@
+Independent domination in chordal graphs
@@ Property / cites work: Independent domination in chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On diameters and radii of bridged graphs
@@ Property / cites work: On diameters and radii of bridged graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Transitiv orientierbare Graphen
@@ Property / cites work: Transitiv orientierbare Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+\(P_{5}\)-free augmenting graphs and the maximum stable set problem
+Normal rank
@@ Property / cites work @@
+On the X-join decomposition for undirected graphs
@@ Property / cites work: On the X-join decomposition for undirected graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5572939
@@ Property / cites work: Q5572939 / rank @@
+Normal rank
@@ Property / cites work @@
+On finding augmenting graphs
@@ Property / cites work: On finding augmenting graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Independent sets in extensions of 2\(K_{2}\)-free graphs
+Normal rank
@@ Property / cites work @@
+Maximum independent sets in subclasses of \(P_{5}\)-free graphs
+Normal rank
@@ Property / cites work @@
+Stable sets in \(k\)-colorable \(P_{5}\)-free graphs
+Normal rank
@@ Property / cites work @@
+Modular decomposition and transitive orientation
@@ Property / cites work: Modular decomposition and transitive orientation / rank @@
+Normal rank
@@ Property / cites work @@
+Q3686754
@@ Property / cites work: Q3686754 / rank @@
+Normal rank
@@ Property / cites work @@
+Some results on maximum stable sets in certain \(P_{5}\)-free graphs
+Normal rank
@@ Property / cites work @@
+Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs
+Normal rank
@@ Property / cites work @@
+On maximum independent sets in \(P_{5}\)-free graphs
+Normal rank
@@ Property / cites work @@
+Edge Dominating Sets in Graphs
@@ Property / cites work: Edge Dominating Sets in Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Satgraphs and independent domination. I
@@ Property / cites work: Satgraphs and independent domination. I / rank @@
+Normal rank