Pages that link to "Item:Q1196453"
From MaRDI portal
The following pages link to Canonical representations of partial 2- and 3-trees (Q1196453):
Displaying 12 items.
- Canonical tree-decompositions of finite graphs. II. Essential parts (Q257005) (← links)
- Using SPQR-trees to speed up algorithms based on 2-cutset decompositions (Q324769) (← links)
- Visibility drawings of plane 3-trees with minimum area (Q691641) (← links)
- Efficient frequent connected subgraph mining in graphs of bounded tree-width (Q982649) (← links)
- Canonical representatives for patterns of tree maps (Q1356382) (← links)
- Computing the maximal canonical form for trees in polynomial time (Q2636446) (← links)
- Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth (Q2968151) (← links)
- A characterization of partial 3-trees (Q3479834) (← links)
- A Logspace Algorithm for Partial 2-Tree Canonization (Q3503623) (← links)
- Characterization and Recognition of Partial 3-Trees (Q3728922) (← links)
- Product graph representations (Q4020705) (← links)
- A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths (Q4645295) (← links)