A characterization of partial 3-trees
From MaRDI portal
Publication:3479834
DOI10.1002/net.3230200304zbMath0701.90092OpenAlexW2060903706MaRDI QIDQ3479834
No author found.
Publication date: 1990
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230200304
Related Items (18)
The structure of obstructions to treewidth and pathwidth ⋮ On the critical densities of minor-closed classes ⋮ Characterizing width two for variants of treewidth ⋮ Constructive linear time algorithms for branchwidth ⋮ Properties of Large 2-Crossing-Critical Graphs ⋮ Characterizing graphs of maximum matching width at most 2 ⋮ Characterising graphs with no subdivision of a wheel of bounded diameter ⋮ Tangle bases: Revisited ⋮ A lower bound for treewidth and its consequences ⋮ On 3-cutwidth critical graphs ⋮ Forbidden directed minors and Kelly-width ⋮ A characterization of some graph classes using excluded minors ⋮ Treewidth, crushing and hyperbolic volume ⋮ Using a hybrid of exact and genetic algorithms to design survivable networks ⋮ Algorithms and obstructions for linear-width and related search parameters ⋮ Surfaces, tree-width, clique-minors, and partitions ⋮ A note on partial 3-trees and homomorphism bases of graphs ⋮ Minors of quasi 4-connected graphs
Cites Work
This page was built for publication: A characterization of partial 3-trees
