Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\) (Q2692778): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3201876934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obstructions for linear rank-width at most 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-minors, monadic second-order logic, and a conjecture by Seese / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the excluded minors for the matroids of branch-width \(k\) / 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: The Tutte Polynomial for Matroids of Bounded Branch-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructive algorithm for path-width of matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The “Art of Trellis Decoding” Is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluded vertex-minors for graphs of linear rank-width at most k. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluded vertex-minors for graphs of linear rank-width at most \(k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear rank-width of distance-hereditary graphs II. vertex-minor obstructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outerplanar obstructions for matroid pathwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on the size of obstructions and intertwines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Layouts in Submodular Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-width and vertex-minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating clique-width and branch-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5390304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. IV: Tree-width and well-quasi-ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Menger's theorem for matroids / rank
 
Normal rank

Latest revision as of 19:24, 31 July 2024

scientific article
Language Label Description Also known as
English
Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\)
scientific article

    Statements

    Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\) (English)
    0 references
    0 references
    0 references
    0 references
    23 March 2023
    0 references
    0 references
    0 references
    0 references
    0 references
    path-width
    0 references
    matroid
    0 references
    linear rank-width
    0 references
    forbidden minor
    0 references
    vertex-minor
    0 references
    pivot-minor
    0 references
    0 references