Pages that link to "Item:Q1086577"
From MaRDI portal
The following pages link to Characterization of partial 3-trees in terms of three structures (Q1086577):
Displaying 11 items.
- The three-in-a-tree problem (Q653792) (← links)
- Forbidden minors characterization of partial 3-trees (Q913807) (← links)
- The nonexistence of reduction rules giving an embedding into a \(k\)-tree (Q1336627) (← links)
- Algorithms and obstructions for linear-width and related search parameters (Q1582084) (← links)
- Reduction algorithms for graphs of small treewidth (Q1854433) (← links)
- Recognizing \(P_ 3\)-structure: A switching approach (Q1924124) (← links)
- A characterization of partial 3-trees (Q3479834) (← links)
- Characterization and Recognition of Partial 3-Trees (Q3728922) (← links)
- Graph decompositions and tree automata in reasoning with uncertainty (Q4286533) (← links)
- Constructive linear time algorithms for branchwidth (Q4571992) (← links)
- Minimum size tree-decompositions (Q5916057) (← links)