Treewidth for graphs with small chordality (Q1372729): Difference between revisions

@@ Property / cites work @@
+Finding and counting given length cycles
@@ Property / cites work: Finding and counting given length cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+Q4291429
@@ Property / cites work: Q4291429 / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
+Normal rank
@@ Property / cites work @@
+Parallel algorithms with optimal speedup for bounded treewidth
+Normal rank
@@ Property / cites work @@
+Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
+Normal rank
@@ Property / cites work @@
+Treewidth and Pathwidth of Permutation Graphs
@@ Property / cites work: Treewidth and Pathwidth of Permutation Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Pathwidth and Treewidth of Cographs
@@ Property / cites work: The Pathwidth and Treewidth of Cographs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3728934
@@ Property / cites work: Q3728934 / rank @@
+Normal rank
@@ Property / cites work @@
+Asteroidal Triple-Free Graphs
@@ Property / cites work: Asteroidal Triple-Free Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fugitive-search games on graphs and related parameters
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for clustering graphs with dominating diametral path
+Normal rank
@@ Property / cites work @@
+A Sufficient Condition for Backtrack-Free Search
@@ Property / cites work: A Sufficient Condition for Backtrack-Free Search / rank @@
+Normal rank
@@ Property / cites work @@
+Transitiv orientierbare Graphen
@@ Property / cites work: Transitiv orientierbare Graphen / rank @@
+Normal rank
@@ Property / cites work @@
+On the pathwidth of chordal graphs
@@ Property / cites work: On the pathwidth of chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Weakly triangulated graphs
@@ Property / cites work: Weakly triangulated graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The Linkage of a Graph
@@ Property / cites work: The Linkage of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+TREEWIDTH OF CIRCLE GRAPHS
@@ Property / cites work: TREEWIDTH OF CIRCLE GRAPHS / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth of Chordal Bipartite Graphs
@@ Property / cites work: Treewidth of Chordal Bipartite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+<i>k</i>-Degenerate Graphs
@@ Property / cites work: <i>k</i>-Degenerate Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized Nested Dissection
@@ Property / cites work: Generalized Nested Dissection / rank @@
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Applications of a Planar Separator Theorem
@@ Property / cites work: Applications of a Planar Separator Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Q5670645
@@ Property / cites work: Q5670645 / 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 @@
+Graph minors. I. Excluding a forest
@@ Property / cites work: Graph minors. I. Excluding a forest / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. III. Planar tree-width
@@ Property / cites work: Graph minors. III. Planar tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Treewidth of Circular-Arc Graphs
@@ Property / cites work: Treewidth of Circular-Arc Graphs / rank @@
+Normal rank