The following pages link to Pathwidth of outerplanar graphs (Q3445500):
Displayed 6 items.
- Nondeterministic graph searching: from pathwidth to treewidth (Q1024783) (← links)
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size (Q2093579) (← links)
- Non-deterministic graph searching in trees (Q2344776) (← links)
- Graph classes and the switch Markov chain for matchings (Q5963358) (← links)
- Pathlength of outerplanar graphs (Q6109003) (← links)
- Branchwidth is \((1, g)\)-self-dual (Q6126712) (← links)