On the treewidth of toroidal grids (Q897618): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4734761 / 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: Lower bounds on the pathwidth of some grid-like graphs / 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: The carving-width of generalized hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for treewidth of product 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: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickly excluding a planar graph / 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: Treewidth of Cartesian Products of Highly Connected Graphs / rank
 
Normal rank

Latest revision as of 04:38, 11 July 2024

scientific article
Language Label Description Also known as
English
On the treewidth of toroidal grids
scientific article

    Statements