scientific article
From MaRDI portal
Publication:3684139
zbMath0568.05025MaRDI QIDQ3684139
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items
The structure of obstructions to treewidth and pathwidth, Trees, grids, and MSO decidability: from graphs to matroids, Testing superperfection of k-trees, The geometry of graphs and some of its algorithmic applications, Unnamed Item, Fixed-Parameter Tractability of Treewidth and Pathwidth, Nonconstructive advances in polynomial-time complexity, Ordered colourings, On the complexity of graph embeddings, Tree-decompositions, tree-representability and chordal graphs, On the complexity of graph reconstruction, Spectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. Tait, Constructive linear time algorithms for branchwidth, On interval routing schemes and treewidth, Achievable sets, brambles, and sparse treewidth obstructions, Subgraphs and well‐quasi‐ordering, Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results, Tangle bases: Revisited, The length of an intersection, On termination of graph rewriting, On Interval Routing Schemes and treewidth, Three ways to cover a graph, Coloring algorithms for \(K_ 5\)-minor free graphs, The theory of guaranteed search on graphs, Edge-intersection graphs of grid paths: the bend-number, On two dual classes of planar graphs, Confronting intractability via parameters, Branch-depth: generalizing tree-depth of graphs, Properties of vertex cover obstructions, Unifying tree decompositions for reasoning in graphical models, Constructive complexity, The behavior of clique-width under graph operations and graph transformations, A Practical Approach to Courcelle's Theorem, Branch-width, parse trees, and monadic second-order logic for matroids., Excluding a large theta graph, Lift-contractions, The complexity ecology of parameters: An illustration using bounded max leaf number, A Kuratowski theorem for nonorientable surfaces, Structure and recognition of graphs with no 6-wheel subdivision, On computing graph minor obstruction sets, Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs, Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover, Parameterized computation and complexity: a new approach dealing with NP-hardness, Backdoors to tractable answer set programming, Counting \(H-\)colorings of partial \(k-\)trees, The structure of the models of decidable monadic theories of graphs, Minimal acyclic forbidden minors for the family of graphs with bounded path-width
