A decomposition theory for matroids. III. Decomposition conditions (Q1086242): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The matroids with the max-flow min-cut property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of regular matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition of the matroids with the max-flow min-cut property / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the efficiency of representability tests for matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial matroid representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theory for matroids. I: General results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theory for matroids. II. Minimal violation matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Max-Flow Min-Cut Matroids: Polynomial Testing and Polynomial Algorithms for Maximum Flow and Shortest Routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank

Latest revision as of 16:59, 17 June 2024

scientific article
Language Label Description Also known as
English
A decomposition theory for matroids. III. Decomposition conditions
scientific article

    Statements

    A decomposition theory for matroids. III. Decomposition conditions (English)
    0 references
    1986
    0 references
    [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.
    0 references
    matroid decomposition
    0 references
    minor
    0 references
    0 references

    Identifiers