Characterization of partial 3-trees in terms of three structures
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3420184 (Why is no real title available?)
- Networks immune to isolated failures
- On simple characterizations of k-trees
- Properties and characterizations of k ‐trees
- Separating subgraphs in k-trees: Cables and caterpillars
- Steiner trees, partial 2–trees, and minimum IFI networks
Cited in
(14)- The nonexistence of reduction rules giving an embedding into a \(k\)-tree
- Algorithms and obstructions for linear-width and related search parameters
- Reduction algorithms for graphs of small treewidth
- Recognizing \(P_ 3\)-structure: A switching approach
- PERTURBED INVARIANT UNDER A CYCLIC PERMUTATION WITH TRACE OF NEUTRINO MASS MATRIX REMAIN CONSTANT
- NC Algorithms for Recognizing Partial 2-Trees and 3-Trees
- A characterization of partial 3-trees
- Characterization and Recognition of Partial 3-Trees
- scientific article; zbMATH DE number 4008410 (Why is no real title available?)
- Graph decompositions and tree automata in reasoning with uncertainty
- Constructive linear time algorithms for branchwidth
- Minimum size tree-decompositions
- The three-in-a-tree problem
- Forbidden minors characterization of partial 3-trees
This page was built for publication: Characterization of partial 3-trees in terms of three structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1086577)
