Linked tree-decompositions of represented infinite matroids (Q716055): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Linked tree-decompositions of represented infinite matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-width and well-quasi-ordering in matroids and graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cliques in dense GF(\(q\))-representable matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Addendum to matroid tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Varieties of Combinatorial Geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Menger-like property of the three-width of infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-Quasi-Ordering Infinite Graphs with Forbidden Finite Planar Minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2703793 / rank
 
Normal rank

Latest revision as of 00:12, 4 July 2024

scientific article
Language Label Description Also known as
English
Linked tree-decompositions of represented infinite matroids
scientific article

    Statements

    Linked tree-decompositions of represented infinite matroids (English)
    0 references
    0 references
    19 April 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    tree-width
    0 references
    branch-width
    0 references
    infinite matroids
    0 references
    tree decomposition
    0 references
    well-quasi-ordering
    0 references
    0 references