Matroid tree-width
type: Item
instance of: scholarly article
title: Matroid tree-width
zbMATH Open document ID: 1103.05019
author: Petr Hliněný
author: Geoff Whittle
published in: European Journal of Combinatorics
publication date: 2006-11-15T00:00:00Z
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 5072912
MaRDI profile type: Publication
full work available at URL: j.ejc.2006.06.005
OpenAlex ID: W4210930323
cites work: Q4291429
cites work: Q4393480
cites work: Branch-width and well-quasi-ordering in matroids and graphs.
cites work: On the excluded minors for the matroids of branch-width \(k\)
cites work: Obstructions to branch-decomposition of matroids
cites work: Excluding a planar graph from \(\mathrm{GF}(q)\)-representable matroids
cites work: A Parametrized Algorithm for Matroid Branch-Width
cites work: Branch-width, parse trees, and monadic second-order logic for matroids.
cites work: Trees, grids, and MSO decidability: from graphs to matroids
cites work: Q4381404
cites work: Q3135082
cites work: Graph minors. X: Obstructions to tree-decomposition
DOI: 10.1016/J.EJC.2006.06.005
description: scientific article; zbMATH DE number 5072912