Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4647595 | Discrete Mathematics | 2014 | 7 Pages |
Abstract
For each non-negative integer k, we provide all outerplanar obstructions for the class of graphs whose cycle matroid has pathwidth at most k. Our proof combines a decomposition lemma for proving lower bounds on matroid pathwidth and a relation between matroid pathwidth and linear width. Our results imply the existence of a linear algorithm that, given an outerplanar graph, outputs its matroid pathwidth.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Athanassios Koutsonas, Dimitrios M. Thilikos, Koichi Yamazaki,