A decomposition theory for matroids. III. Decomposition conditions
type: Item
instance of: scholarly article
title: A decomposition theory for matroids. III. Decomposition conditions
zbMATH Open document ID: 0608.05021
DOI: 10.1016/0095-8956(86)90052-3
published in: Journal of Combinatorial Theory. Series B
publication date: 1986-01-01T00:00:00Z
review text: [For the former parts I and II see ibid. 39, 43-76 (1985; Zbl 0551.05033), and ibid. 39, 282-297 (1985; see the review above).] Part III presents some sufficient conditions to ensure that a decomposable minor of a matroid (with respect to the operation k-sum) induces a decomposition of the matroid itself. These conditions are then applied recursively for an algorithm that produces decomposition theorems.
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 3983178
zbMATH Keywords: matroid decomposition
zbMATH Keywords: minor
author: Klaus Truemper
reviewed by: András Recski
MaRDI profile type: Publication
full work available at URL: 0095-8956(86)90052-3
OpenAlex ID: W2162113336
cites work: Q3048571
cites work: The matroids with the max-flow min-cut property
cites work: Decomposition of regular matroids
cites work: A decomposition of the matroids with the max-flow min-cut property
cites work: On the efficiency of representability tests for matroids
cites work: Q3220598
cites work: Partial matroid representations
cites work: A decomposition theory for matroids. I: General results
cites work: A decomposition theory for matroids. II. Minimal violation matroids
cites work: Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes
cites work: Q4111952
description: scientific article; zbMATH DE number 3983178