scientific article
From MaRDI portal
Publication:2857402
zbMath1274.05100MaRDI QIDQ2857402
Koichi Yamazaki, Dimitrios M. Thilikos, Athanassios Koutsonas
Publication date: 1 November 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065311001570
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (3)
Graph Minors and Parameterized Algorithm Design ⋮ Forbidding Kuratowski Graphs as Immersions ⋮ Characterizing graphs of small carving-width
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
- Computing Representations of Matroids of Bounded Branch-Width
- Matroid Pathwidth and Code Trellis Complexity
- 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:
