Pages that link to "Item:Q4264493"
From MaRDI portal
The following pages link to Graphs with Branchwidth at Most Three (Q4264493):
Displaying 15 items.
- Branchwidth of chordal graphs (Q967314) (← links)
- Edge-maximal graphs of branchwidth \(k\): The \(k\)-branches (Q1024454) (← links)
- Algorithms and obstructions for linear-width and related search parameters (Q1582084) (← links)
- Computing the branchwidth of interval graphs (Q1764810) (← links)
- Strong branchwidth and local transversals (Q1764812) (← links)
- Minor obstructions for apex-pseudoforests (Q2043398) (← links)
- Sparse obstructions for minor-covering parameters (Q2174553) (← links)
- Characterizing graphs of maximum matching width at most 2 (Q2413972) (← links)
- Characterizing graphs of small carving-width (Q2446832) (← links)
- On strict brambles (Q2689118) (← links)
- Forbidding Kuratowski Graphs as Immersions (Q2940987) (← links)
- Minor-Minimal Planar Graphs of Even Branch-Width (Q3068814) (← links)
- Edge-maximal graphs of branchwidth k (Q3439366) (← links)
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions (Q6038588) (← links)
- Tangle bases: Revisited (Q6087071) (← links)