On a covering problem of Mullin and Stanton for binary matroids (Q1139053): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A strengthened form of Tutte's characterization of regular matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Model for Series-Parallel Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decomposition for Combinatorial Geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Foundations of Combinatorial Theory II. Combinatorial Geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: COLOURING, PACKING AND THE CRITICAL PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algebraic theory of graph colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4245210206 / rank
 
Normal rank

Latest revision as of 10:27, 30 July 2024

scientific article
Language Label Description Also known as
English
On a covering problem of Mullin and Stanton for binary matroids
scientific article

    Statements

    On a covering problem of Mullin and Stanton for binary matroids (English)
    0 references
    0 references
    1980
    0 references
    0 references
    (m,k) cover
    0 references
    minimal (m,k)-matroid
    0 references
    minimal m-blocks
    0 references
    0 references
    0 references