Computing the vertex separation of unicyclic graphs (Q596295): Difference between revisions

@@ Property / cites work @@
+Approximation of pathwidth of outerplanar graphs
@@ Property / cites work: Approximation of pathwidth of outerplanar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
+Normal rank
@@ Property / cites work @@
+The vertex separation and search number of a graph
+Normal rank
@@ Property / cites work @@
+Approximating the pathwidth of outerplanar graphs
@@ Property / cites work: Approximating the pathwidth of outerplanar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The vertex separation number of a graph equals its path-width
+Normal rank
@@ Property / cites work @@
+Interval graphs and searching
@@ Property / cites work: Interval graphs and searching / rank @@
+Normal rank
@@ Property / cites work @@
+Searching and pebbling
@@ Property / cites work: Searching and pebbling / rank @@
+Normal rank
@@ Property / cites work @@
+Recontamination does not help to search a graph
@@ Property / cites work: Recontamination does not help to search a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Min Cut is NP-complete for edge weighted trees
@@ Property / cites work: Min Cut is NP-complete for edge weighted trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4218431
@@ Property / cites work: Q4218431 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2753956
@@ Property / cites work: Q2753956 / rank @@
+Normal rank