The Treewidth and Pathwidth of Graph Unions (Q6141861): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Ordered Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relationship Between Clique-Width and Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5272625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The planar tree packing theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Caterpillar arboricity of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3952131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex separation number of a graph equals its path-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-quasi-ordering versus clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs Into Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank

Latest revision as of 19:47, 23 August 2024

scientific article; zbMATH DE number 7793139
Language Label Description Also known as
English
The Treewidth and Pathwidth of Graph Unions
scientific article; zbMATH DE number 7793139

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references