On finding a minimum vertex cover of a series-parallel graph (Q758196): Difference between revisions

@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
+Normal rank
@@ Property / cites work @@
+The complexity of comparability graph recognition and coloring
+Normal rank
@@ Property / cites work @@
+Q3315556
@@ Property / cites work: Q3315556 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear-time computability of combinatorial problems on series-parallel graphs
+Normal rank
@@ Property / cites work @@
+The Recognition of Series Parallel Digraphs
@@ Property / cites work: The Recognition of Series Parallel Digraphs / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0893-9659(89)90075-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2019119668
@@ Property / OpenAlex ID: W2019119668 / rank @@
+Normal rank