Graph minors. III. Planar tree-width
From MaRDI portal
Publication:799684
DOI10.1016/0095-8956(84)90013-3zbMath0548.05025WikidataQ56141697 ScholiaQ56141697MaRDI QIDQ799684
Publication date: 1984
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(84)90013-3
Related Items
A partial k-arboretum of graphs with bounded treewidth, Improved self-reduction algorithms for graphs with bounded treewidth, Datalog vs first-order logic, Treewidth for graphs with small chordality, Fugitive-search games on graphs and related parameters, Multiplicities of eigenvalues and tree-width of graphs, Graph minors. IX: Disjoint crossed paths, On tree-partitions of graphs, On the complexity of the disjoint paths problem, Excluding Subdivisions of Infinite Cliques