A linear-time recognition algorithm for \(P_{4}\)-reducible graphs (Q673108): Difference between revisions

@@ Property / cites work @@
+Q3941433
@@ Property / cites work: Q3941433 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3697033
@@ Property / cites work: Q3697033 / rank @@
+Normal rank
@@ Property / cites work @@
+Complement reducible graphs
@@ Property / cites work: Complement reducible graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Recognition Algorithm for Cographs
@@ Property / cites work: A Linear Recognition Algorithm for Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+<i>P</i><sub>4</sub>-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
+Normal rank
@@ Property / cites work @@
+Q3355252
@@ Property / cites work: Q3355252 / rank @@
+Normal rank
@@ Property / cites work @@
+On a class of posets and the corresponding comparability graphs
+Normal rank
@@ Property / cites work @@
+On a property of the class of n-colorable graphs
@@ Property / cites work: On a property of the class of n-colorable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Dacey Graphs
@@ Property / cites work: Dacey Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Incremental modular decomposition
@@ Property / cites work: Incremental modular decomposition / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(95)00016-p
+Normal rank
@@ Property / OpenAlex ID @@
+W2038893115
@@ Property / OpenAlex ID: W2038893115 / rank @@
+Normal rank