Tree-width of hypergraphs and surface duality (Q414640): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jctb.2011.11.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1986576219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth lower bounds with brambles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chordal embeddings of planar graphs / 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: S-functions for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-width of graphs and surface duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XV: Giant steps / 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: Q5284579 / rank
 
Normal rank

Latest revision as of 04:10, 5 July 2024

scientific article
Language Label Description Also known as
English
Tree-width of hypergraphs and surface duality
scientific article

    Statements

    Identifiers

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