Pages that link to "Item:Q3150282"
From MaRDI portal
The following pages link to Approximation of pathwidth of outerplanar graphs (Q3150282):
Displaying 22 items.
- Approximating the pathwidth of outerplanar graphs (Q293398) (← links)
- Outerplanar obstructions for matroid pathwidth (Q393173) (← links)
- On self-duality of branchwidth in graphs of bounded genus (Q411870) (← links)
- Tree \(t\)-spanners in outerplanar graphs via supply demand partition (Q496441) (← links)
- Computing the vertex separation of unicyclic graphs (Q596295) (← links)
- 2-connecting outerplanar graphs without blowing up the pathwidth (Q744095) (← links)
- Linear-time algorithms for problems on planar graphs with fixed disk dimension (Q845887) (← links)
- Approximate search strategies for weighted trees (Q1929222) (← links)
- Non-deterministic graph searching in trees (Q2344776) (← links)
- A polynomial-time algorithm for outerplanar diameter improvement (Q2402366) (← links)
- Outerplanar obstructions for matroid pathwidth (Q2857402) (← links)
- Connected Graph Searching in Outerplanar Graphs (Q3439336) (← links)
- Pathwidth of outerplanar graphs (Q3445500) (← links)
- On self duality of pathwidth in polyhedral graph embeddings (Q3445501) (← links)
- Pathwidth of Circular-Arc Graphs (Q3508573) (← links)
- A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar Graphs (Q4485193) (← links)
- Circumference and Pathwidth of Highly Connected Graphs (Q5265331) (← links)
- A 3-approximation for the pathwidth of Halin graphs (Q5898649) (← links)
- A 3-approximation for the pathwidth of Halin graphs (Q5899362) (← links)
- Branchwidth is \((1, g)\)-self-dual (Q6126712) (← links)
- Pathwidth vs Cocircumference (Q6195950) (← links)
- Splitting plane graphs to outerplanarity (Q6636997) (← links)
