Pages that link to "Item:Q3479834"
From MaRDI portal
The following pages link to A characterization of partial 3-trees (Q3479834):
Displaying 19 items.
- Characterizing width two for variants of treewidth (Q344827) (← links)
- Forbidden directed minors and Kelly-width (Q501668) (← links)
- A characterization of some graph classes using excluded minors (Q950291) (← links)
- A note on partial 3-trees and homomorphism bases of graphs (Q1313444) (← links)
- Minors of quasi 4-connected graphs (Q1318814) (← links)
- On 3-cutwidth critical graphs (Q1420615) (← links)
- Algorithms and obstructions for linear-width and related search parameters (Q1582084) (← links)
- The structure of obstructions to treewidth and pathwidth (Q1613365) (← links)
- On the critical densities of minor-closed classes (Q1621066) (← links)
- Surfaces, tree-width, clique-minors, and partitions (Q1850479) (← links)
- Treewidth, crushing and hyperbolic volume (Q2279065) (← links)
- Characterizing graphs of maximum matching width at most 2 (Q2413972) (← links)
- Characterization and Recognition of Partial 3-Trees (Q3728922) (← links)
- Constructive linear time algorithms for branchwidth (Q4571992) (← links)
- Properties of Large 2-Crossing-Critical Graphs (Q5084710) (← links)
- Using a hybrid of exact and genetic algorithms to design survivable networks (Q5955471) (← links)
- Characterising graphs with no subdivision of a wheel of bounded diameter (Q6038576) (← links)
- Tangle bases: Revisited (Q6087071) (← links)
- Forbidden minors: finding the finite few (Q6599235) (← links)
