Graph minors. I. Excluding a forest
From MaRDI portal
Publication:1055450
DOI10.1016/0095-8956(83)90079-5zbMath0521.05062WikidataQ29013762 ScholiaQ29013762MaRDI QIDQ1055450
Publication date: 1983
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(83)90079-5
Related Items
Graph Minors I: A Short Proof of the Path-width Theorem, Mineurs d'arbres avec racines, A simple linear-time algorithm for finding path-decompositions of small width, Mixed searching and proper-path-width, Quickly excluding a forest, Narrowness, pathwidth, and their application in natural language processing, Excluding infinite minors, All structured programs have small tree width and good register allocation, Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms, A partial k-arboretum of graphs with bounded treewidth, On the pathwidth of chordal graphs, Minimal acyclic forbidden minors for the family of graphs with bounded path-width, Obstruction set isolation for the gate matrix layout problem, Treewidth for graphs with small chordality, Helicopter search problems, bandwidth and pathwidth, Triangulating multitolerance graphs, Edge and node searching problems on trees, On computing graph minor obstruction sets, Tree-width, path-width, and cutwidth, Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion), Transformations of cubic graphs, Excluding Subdivisions of Infinite Cliques, Excluding Infinite Trees
