A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths (Q4645295): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An algebraic theory of graph reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical representations of partial 2- and 3-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph expressions and graph rewritings / 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: The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200260 / 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: Combinatorial algorithms on a class of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4005203 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simple characterizations of k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Recognition of Series Parallel Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal acyclic forbidden minors for the family of graphs with bounded path-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized finite automata theory with an application to a decision problem of second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner trees, partial 2–trees, and minimum IFI networks / rank
 
Normal rank

Latest revision as of 20:33, 17 July 2024

scientific article; zbMATH DE number 6999597
Language Label Description Also known as
English
A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths
scientific article; zbMATH DE number 6999597

    Statements

    A technique for recognizing graphs of bounded treewidth with application to subclasses of partial 2-paths (English)
    0 references
    0 references
    0 references
    10 January 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references