A 3-approximation for the pathwidth of Halin graphs (Q5898649): Difference between revisions

@@ Property / cites work @@
+Q4873678
@@ Property / cites work: Q4873678 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4035355
@@ Property / cites work: Q4035355 / rank @@
+Normal rank
@@ Property / cites work @@
+Monotonicity in graph searching
@@ Property / cites work: Monotonicity in graph searching / rank @@
+Normal rank
@@ Property / cites work @@
+Q3795218
@@ Property / cites work: Q3795218 / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ 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 @@
+Lengths of cycles in halin graphs
@@ Property / cites work: Lengths of cycles in halin graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Halin graphs and the travelling salesman problem
@@ Property / cites work: Halin graphs and the travelling salesman problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4273878
@@ Property / cites work: Q4273878 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the vertex separation of unicyclic 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 @@
+Über simpliziale Zerfällungen beliebiger (endlicher oder unendlicher) Graphen
+Normal rank
@@ Property / cites work @@
+Efficient Planarity Testing
@@ Property / cites work: Efficient Planarity Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Q3139275
@@ Property / cites work: Q3139275 / 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 @@
+The complexity of searching a graph
@@ Property / cites work: The complexity of searching a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q3477966
@@ Property / cites work: Q3477966 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. I. Excluding a forest
@@ Property / cites work: Graph minors. I. Excluding a forest / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time
+Normal rank
@@ Property / cites work @@
+Minimum cycle bases of Halin graphs
@@ Property / cites work: Minimum cycle bases of Halin graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and obstructions for linear-width and related search parameters
+Normal rank