The treewidth and pathwidth of hypercubes (Q819827): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3747267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof for a theorem of Harper about Hamming-spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal numberings and isoperimetric problems on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an isoperimetric problem for Hamming graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140999 / 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. I. Excluding a forest / rank
 
Normal rank

Revision as of 11:40, 24 June 2024

scientific article
Language Label Description Also known as
English
The treewidth and pathwidth of hypercubes
scientific article

    Statements

    Identifiers