Lower bounds for treewidth of product graphs (Q741743): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems / 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: Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth lower bounds with brambles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hadwiger's conjecture is true for almost every graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hadwiger's conjecture for graph products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4838483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph decompositions for cartesian products / 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: Finding Large Clique Minors is Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Minimum Weight Vertex Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \) / 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 expansion and the unique games conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407447 / 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: Treewidth of Cartesian Products of Highly Connected Graphs / rank
 
Normal rank

Revision as of 00:47, 9 July 2024

scientific article
Language Label Description Also known as
English
Lower bounds for treewidth of product graphs
scientific article

    Statements

    Lower bounds for treewidth of product graphs (English)
    0 references
    0 references
    0 references
    0 references
    12 September 2014
    0 references
    treewidth
    0 references
    bramble
    0 references
    Hadwiger number
    0 references
    Cartesian product
    0 references
    strong product
    0 references

    Identifiers