On computing graph minor obstruction sets (Q1575945): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Q494055 / rank
Normal rank
 
Property / author
 
Property / author: Rodney G. Downey / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickly excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two strikes against perfect phylogeny / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obstructions to within a few vertices or edges of acyclic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple linear-time algorithm for finding path-decompositions of small width / 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: Equivalent definitions of recognizability for sets of graphs of bounded tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonconstructive tools for proving polynomial-time decidability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the Size of Planar Intertwines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Obstruction set isolation for the gate matrix layout problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036591 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5734436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273872 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank

Latest revision as of 12:16, 30 May 2024

scientific article
Language Label Description Also known as
English
On computing graph minor obstruction sets
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references