Parameters Tied to Treewidth (Q2978180): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Coloring with no 2-colored \(P_4\)'s / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth lower bounds with brambles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicities of eigenvalues and tree-width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: h-Quasi Planar Drawings of Bounded Treewidth Graphs in Linear Area / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly connected sets and the excluded grid theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Layout of Graphs with Bounded Tree-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tree width, bramble size, and expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5837979 / rank
 
Normal rank
Property / cites work
 
Property / cites work: S-functions for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some recent progress and applications in graph minor theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Parameterized Intractability of Monadic Second-Order Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonrepetitive colorings of graphs of bounded tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-width and planar minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achievable sets, brambles, and sparse treewidth obstructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-degree graph expansions that preserve treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional colouring and Hadwiger's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial treewidth forces a large grid-like-minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. I. Excluding a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. V. Excluding a planar graph / 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. X: Obstructions to tree-decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadwiger's conjecture for \(K_ 6\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickly excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On simple characterizations of k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph searching and a min-max theorem for tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique minors in Cartesian products of graphs / rank
 
Normal rank

Revision as of 16:55, 13 July 2024

scientific article
Language Label Description Also known as
English
Parameters Tied to Treewidth
scientific article

    Statements

    Parameters Tied to Treewidth (English)
    0 references
    0 references
    0 references
    21 April 2017
    0 references
    graph parameters
    0 references
    treewidth
    0 references
    separators
    0 references
    branchwidth
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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