ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P4'S (Q5249008): Difference between revisions

@@ Property / cites work @@
+A Fast Algorithm for the Decomposition of Graphs and Posets
+Normal rank
@@ Property / cites work @@
+On the structure of graphs with few \(P_4\)s
@@ Property / cites work: On the structure of graphs with few \(P_4\)s / rank @@
+Normal rank
@@ Property / cites work @@
+Complement reducible graphs
@@ Property / cites work: Complement reducible graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs
+Normal rank
@@ Property / cites work @@
+<i>P</i><sub>4</sub>-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
+Normal rank
@@ Property / cites work @@
+Recognizing $P_4 $-Sparse Graphs in Linear Time
@@ Property / cites work: Recognizing $P_4 $-Sparse Graphs in Linear Time / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time recognition algorithm for \(P_{4}\)-reducible graphs
+Normal rank
@@ Property / cites work @@
+\(k\)-NLC graphs and polynomial algorithms
@@ Property / cites work: \(k\)-NLC graphs and polynomial algorithms / rank @@
+Normal rank

ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P<sub>4</sub>'S (Q5249008): Difference between revisions