Treewidth of Cartesian Products of Highly Connected Graphs (Q5325943): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1691925402 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1105.1586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the bandwidth of 3-dimensional Hamming graphs / 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: Treewidth lower bounds with brambles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The treewidth and pathwidth of hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal labelling of a product of two paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth and logical definability of graph products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Indexing of the Vertices of Graphs / 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 the bandwidth of a Hamming graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth of the Cartesian product of two connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth and pathwidth of three-dimensional grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. V. 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: Clique minors in Cartesian products of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on graph minors and strong products / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:23, 6 July 2024

scientific article; zbMATH DE number 6193105
Language Label Description Also known as
English
Treewidth of Cartesian Products of Highly Connected Graphs
scientific article; zbMATH DE number 6193105

    Statements

    Treewidth of Cartesian Products of Highly Connected Graphs (English)
    0 references
    0 references
    0 references
    31 July 2013
    0 references
    0 references
    treewidth
    0 references
    Cartesian product
    0 references
    0 references
    0 references