scientific article; zbMATH DE number 1944139
From MaRDI portal
Publication:4407447
zbMath1035.05090MaRDI QIDQ4407447
Publication date: 2003
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (22)
On the feedback vertex set polytope of a series-parallel graph ⋮ Graph drawings with few slopes ⋮ An improved planar graph product structure theorem ⋮ On a characterization of k-trees ⋮ Structure of Graphs with Locally Restricted Crossings ⋮ Separating layered treewidth and row treewidth ⋮ PTAS for Sparse General-valued CSPs ⋮ Graphs of linear growth have bounded treewidth ⋮ Induced subgraphs and path decompositions ⋮ Graph product structure for non-minor-closed classes ⋮ Treewidth, Circle Graphs, and Circular Drawings ⋮ On the structure of (pan, even hole)‐free graphs ⋮ Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs ⋮ On the queue-number of graphs with bounded tree-width ⋮ Improved algorithms and complexity results for power domination in graphs ⋮ Treewidth computations. I: Upper bounds ⋮ The bivariate Ising polynomial of a graph ⋮ Lower bounds for treewidth of product graphs ⋮ Notes on graph product structure theory ⋮ On tree-partition-width ⋮ The Size Ramsey Number of Graphs with Bounded Treewidth ⋮ Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs
This page was built for publication:
