A characterization of partial 3-trees
From MaRDI portal
Recommendations
- Characterization of partial 3-trees in terms of three structures
- Characterization and Recognition of Partial 3-Trees
- A note on partial 3-trees and homomorphism bases of graphs
- Forbidden minors characterization of partial 3-trees
- 3-trees in polyhedral maps
- 3-reconstructibility of rooted trees
- A characterization for a set of partial partitions to define an \(X\)-tree
- A characterization of \(k\)-trees
- Canonical representations of partial 2-and 3-trees
- Canonical representations of partial 2- and 3-trees
Cites work
Cited in
(31)- Characterization of partial 3-trees in terms of three structures
- A note on partial 3-trees and homomorphism bases of graphs
- Minors of quasi 4-connected graphs
- On 3-cutwidth critical graphs
- Algorithms and obstructions for linear-width and related search parameters
- The structure of obstructions to treewidth and pathwidth
- On the critical densities of minor-closed classes
- Surfaces, tree-width, clique-minors, and partitions
- Partial k-trees with maximum chromatic number
- Treewidth, crushing and hyperbolic volume
- Characterizing graphs of maximum matching width at most 2
- Subclasses of \(k\)-trees: characterization and recognition
- On a characterization of \(k\)-trees.
- PERTURBED INVARIANT UNDER A CYCLIC PERMUTATION WITH TRACE OF NEUTRINO MASS MATRIX REMAIN CONSTANT
- NC Algorithms for Recognizing Partial 2-Trees and 3-Trees
- Characterizing width two for variants of treewidth
- scientific article; zbMATH DE number 4144031 (Why is no real title available?)
- \(k\)-trees and some graph operators
- Characterization and Recognition of Partial 3-Trees
- scientific article; zbMATH DE number 4008410 (Why is no real title available?)
- scientific article; zbMATH DE number 4094838 (Why is no real title available?)
- Constructive linear time algorithms for branchwidth
- Forbidden directed minors and Kelly-width
- Properties of large 2-crossing-critical graphs
- Using a hybrid of exact and genetic algorithms to design survivable networks
- Characterising graphs with no subdivision of a wheel of bounded diameter
- Tangle bases: Revisited
- A lower bound for treewidth and its consequences
- Forbidden minors: finding the finite few
- Forbidden minors characterization of partial 3-trees
- A characterization of some graph classes using excluded minors
This page was built for publication: A characterization of partial 3-trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3479834)
