Back to Search
Start Over
Outerplanar obstructions for matroid pathwidth.
- Source :
-
Discrete Mathematics . Feb2014, Vol. 315-316, p95-101. 7p. - Publication Year :
- 2014
-
Abstract
- Abstract: For each non-negative integer , we provide all outerplanar obstructions for the class of graphs whose cycle matroid has pathwidth at most . 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. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 0012365X
- Volume :
- 315-316
- Database :
- Academic Search Index
- Journal :
- Discrete Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 92515756
- Full Text :
- https://doi.org/10.1016/j.disc.2013.10.007