The treewidth of 2-section of hypergraphs (Q5024663): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3993087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonserial dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4291429 / 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: The cutwidth of a graph and the vertex separation number of the line graph / 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: S-functions for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth of the Line Graph of a Complete Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameters Tied to Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The treewidth of line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-width, path-width, and cutwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. III. Planar tree-width / rank
 
Normal rank

Revision as of 20:22, 27 July 2024

scientific article; zbMATH DE number 7465221
Language Label Description Also known as
English
The treewidth of 2-section of hypergraphs
scientific article; zbMATH DE number 7465221

    Statements

    Identifiers