Quickly excluding a forest
From MaRDI portal
Publication:1179478
DOI10.1016/0095-8956(91)90068-UzbMath0763.05023WikidataQ29037364 ScholiaQ29037364MaRDI QIDQ1179478
Robin Thomas, Neil Robertson, P. D. Seymour, Bienstock, Daniel
Publication date: 26 June 1992
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Related Items
Call routing and the ratcatcher, Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems, Tree densities in sparse graph classes, Fixed-Parameter Tractability of Treewidth and Pathwidth, List coloring in the absence of two subgraphs, A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth, A polynomial-time algorithm for outerplanar diameter improvement, Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions, Seymour's conjecture on 2-connected graphs of large pathwidth, Dichotomies properties on computational complexity of \(S\)-packing coloring problems, On interval routing schemes and treewidth, Graph Minors I: A Short Proof of the Path-width Theorem, Unifying Duality Theorems for Width Parameters in Graphs and Matroids (Extended Abstract), Fugitive-search games on graphs and related parameters, A win-win algorithm for the $(k+1)$-LST/$k$-pathwidth problem, Separating layered treewidth and row treewidth, Approximating Pathwidth for Graphs of Small Treewidth, Connected search for a lazy robber, Low Polynomial Exclusion of Planar Graph Patterns, On Interval Routing Schemes and treewidth, Crossing-number critical graphs have bounded path-width, Convergence of Newton's method over commutative semirings, The mixed search game against an agile and visible fugitive is monotone, Induced subgraphs and path decompositions, 2-Layer Graph Drawings with Bounded Pathwidth, On the monotonicity of games generated by symmetric submodular functions., \textsc{max-cut} and containment relations in graphs, Tangle and Maximal Ideal, Minor-Closed Graph Classes with Bounded Layered Pathwidth, On the Block Number of Graphs, An annotated bibliography on guaranteed graph searching, Coloring graphs characterized by a forbidden subgraph, The size of an intertwine, Excluded Forest Minors and the Erdős–Pósa Property, A simple linear-time algorithm for finding path-decompositions of small width, Excluding infinite minors, Tree-width and planar minors, Excluding Subdivisions of Infinite Cliques, Characterization of graphs and digraphs with small process numbers, Directed path-width and monotonicity in digraph searching, max-cut and Containment Relations in Graphs, The complexity ecology of parameters: An illustration using bounded max leaf number, Better Algorithms and Bounds for Directed Maximum Leaf Problems, Excluding Infinite Trees, Directed Path-Decompositions, Upper bounds on the size of obstructions and intertwines, A partial k-arboretum of graphs with bounded treewidth, AND/OR search spaces for graphical models, On computing graph minor obstruction sets, Submodular partition functions, Directed tree-width, Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover, Tree Pivot-Minors and Linear Rank-Width, Circumference and Pathwidth of Highly Connected Graphs
Cites Work
