Degree-constrained decompositions of graphs: Bounded treewidth and planarity (Q2369007): Difference between revisions

@@ Property / DOI @@
-.1016/j.tcs.2006.01.024
@@ Property / DOI: 10.1016/j.tcs.2006.01.024 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2006.01.024
+Normal rank
@@ Property / OpenAlex ID @@
+W2033951727
@@ Property / OpenAlex ID: W2033951727 / 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 @@
+Approximation algorithms for NP-complete problems on planar graphs
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for decomposing graphs under degree constraints
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Q4818840
@@ Property / cites work: Q4818840 / rank @@
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
+Normal rank
@@ Property / cites work @@
+Decomposing graphs with girth at least five under degree constraints
+Normal rank
@@ Property / cites work @@
+Diameter and treewidth in minor-closed graph families
+Normal rank
@@ Property / cites work @@
+Algorithmic approach to the satisfactory graph partitioning problem
+Normal rank
@@ Property / cites work @@
+Algorithms for vertex-partitioning problems on graphs with fixed clique-width.
+Normal rank
@@ Property / cites work @@
+Q4820779
@@ Property / cites work: Q4820779 / rank @@
+Normal rank
@@ Property / cites work @@
+NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
+Normal rank
@@ Property / cites work @@
+Q2762518
@@ Property / cites work: Q2762518 / rank @@
+Normal rank
@@ Property / cites work @@
+On decomposition of triangle-free graphs under degree constraints
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Q4715286
@@ Property / cites work: Q4715286 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems
+Normal rank
@@ Property / DOI @@
+.1016/J.TCS.2006.01.024
@@ Property / DOI: 10.1016/J.TCS.2006.01.024 / rank @@
+Normal rank