Extensions of matroid covering and packing (Q1633609): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fractional arboricity, strength, and principal partitions in graphs and matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the higher-order edge toughness of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of Nash-Williams' theorem for the arboricity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lehmans switching game and a theorem of Tutte and Nash-Williams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum partition of a matroid into independent subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversals and matroid partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4696619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing a graph into pseudoforests with one having bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2713657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing a graph into forests: the nine dragon tree conjecture is true / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing a graph into forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs Into Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spanning tree packing number of a graph: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity) / rank
 
Normal rank
Property / cites work
 
Property / cites work: NASH‐WILLIAMS’ THEOREM ON DECOMPOSING GRAPHS INTO FORESTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing a graph into forests and a matching / rank
 
Normal rank

Latest revision as of 18:34, 17 July 2024

scientific article
Language Label Description Also known as
English
Extensions of matroid covering and packing
scientific article

    Statements

    Extensions of matroid covering and packing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 December 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    loopless matroid
    0 references
    independent sets
    0 references
    0 references