ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES (Q5249049): Difference between revisions

@@ Property / cites work @@
+A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs
+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 @@
+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 @@
+Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
+Normal rank
@@ Property / cites work @@
+Completely separable graphs
@@ Property / cites work: Completely separable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
@@ Property / cites work: A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS / rank @@
+Normal rank
@@ Property / cites work @@
+ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P<sub>4</sub>'S
+Normal rank
@@ Property / cites work @@
+Restricted unimodular chordal graphs
@@ Property / cites work: Restricted unimodular chordal graphs / rank @@
+Normal rank