The following pages link to Pathwidth of outerplanar graphs (Q3445500):
Displaying 9 items.
- Nondeterministic graph searching: from pathwidth to treewidth (Q1024783) (← links)
- Pathwidth of planar and line graphs (Q1396654) (← links)
- Generalized outerplanar Turán number of short paths (Q2092428) (← links)
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size (Q2093579) (← links)
- Non-deterministic graph searching in trees (Q2344776) (← links)
- Approximation of pathwidth of outerplanar graphs (Q3150282) (← links)
- On self duality of pathwidth in polyhedral graph embeddings (Q3445501) (← links)
- Graph classes and the switch Markov chain for matchings (Q5963358) (← links)
- Branchwidth is \((1, g)\)-self-dual (Q6126712) (← links)