Hypertree-depth and minors in hypergraphs (Q1929221): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5469338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-Related Widths of Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and exact computation. 4th international workshop, IWPEC 2009, Copenhagen, Denmark, September 10--11, 2009. Revised selected papers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of induced minors and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Digraph Width Measures in Parameterized Algorithmics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3821580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-depth, subgraph coloring and homomorphism bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grad and classes with bounded expansion. I: Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grad and classes with bounded expansion. II: Algorithmic aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities / 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: Graph minors. III. Planar tree-width / rank
 
Normal rank

Latest revision as of 02:20, 6 July 2024

scientific article
Language Label Description Also known as
English
Hypertree-depth and minors in hypergraphs
scientific article

    Statements

    Hypertree-depth and minors in hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    7 January 2013
    0 references
    0 references
    hypertree-depth
    0 references
    robber and marshals game
    0 references
    minors in hypergraphs
    0 references
    tree-depth
    0 references
    hypertree-width
    0 references
    hyperpath-width
    0 references
    0 references