Outerplanar obstructions for matroid pathwidth

DOI10.1016/j.disc.2013.10.007zbMath1278.05065OpenAlexW2180948381MaRDI QIDQ393173

Dimitrios M. Thilikos, Athanassios Koutsonas, Koichi Yamazaki

Publication date: 16 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.10.007

zbMATH Keywords

obstructionsouterplanar graphspathwidth

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (10)

A Simpler Self-reduction Algorithm for Matroid Path-Width ⋮ Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions ⋮ Sparse obstructions for minor-covering parameters ⋮ An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion ⋮ \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions ⋮ Branchwidth is \((1, g)\)-self-dual ⋮ Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\) ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Minor obstructions for apex-pseudoforests ⋮ Minor-obstructions for apex sub-unicyclic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The structure of 3-connected matroids of path width three
• Constructive characterizations of 3-connected matroids of path width three
• Minimal acyclic forbidden minors for the family of graphs with bounded path-width
• The vertex separation and search number of a graph
• On the excluded minors for the matroids of branch-width \(k\)
• Algorithms and obstructions for linear-width and related search parameters
• Branch-width and well-quasi-ordering in matroids and graphs.
• Fork-decompositions of matroids
• On Rota's conjecture and excluded minors containing large projective geometries.
• The branchwidth of graphs and their cycle matroids
• Excluded vertex-minors for graphs of linear rank-width at most k.
• Mixed search number and linear-width of interval and split graphs
• Computing Representations of Matroids of Bounded Branch-Width
• Matroid Pathwidth and Code Trellis Complexity
• Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time
• The Tutte Polynomial for Matroids of Bounded Branch-Width
• Connectivity in Matroids
• A Combinatorial Model for Series-Parallel Networks

This page was built for publication: Outerplanar obstructions for matroid pathwidth