scientific article
From MaRDI portal
Publication:3692864
zbMath0574.68036MaRDI QIDQ3692864
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75)
Related Items
Regularity and locality in \(k\)-terminal graphs, Grids and their minors, Packing and Covering Immersion Models of Planar Subcubic Graphs, Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs, The parameterised complexity of list problems on graphs of bounded treewidth, On tree-partitions of graphs, Linear time algorithms for NP-hard problems restricted to partial k- trees, Minors in graphs of large \(\theta_r\)-girth, Packing and covering immersion-expansions of planar sub-cubic graphs, Recent techniques and results on the Erdős-Pósa property, Problems hard for treewidth but easy for stable gonality, On the model-checking of monadic second-order formulas with edge set quantifications, Domino treewidth, On minimum dominating sets with minimum intersection, Practical algorithms for MSO model-checking on tree-decomposable graphs, A regular characterization of graph languages definable in monadic second-order logic, Vertex-minor reductions can simulate edge contractions, An \(O(\log \mathrm{OPT})\)-approximation for covering and packing minor models of \(\theta _r\), On the queue-number of graphs with bounded tree-width, Logical aspects of Cayley-graphs: the group case, On tree-partition-width, A partial k-arboretum of graphs with bounded treewidth, The structure of the models of decidable monadic theories of graphs, Bibliography on domination in graphs and some basic definitions of domination parameters
