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

@@ Property / DOI @@
-.1016/j.dam.2013.08.005
@@ Property / DOI: 10.1016/j.dam.2013.08.005 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2013.08.005
+Normal rank
@@ Property / OpenAlex ID @@
+W1967494832
@@ Property / OpenAlex ID: W1967494832 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4258216
@@ Property / cites work: Q4258216 / rank @@
+Normal rank
@@ Property / cites work @@
+Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
+Normal rank
@@ Property / cites work @@
+Treewidth lower bounds with brambles
@@ Property / cites work: Treewidth lower bounds with brambles / rank @@
+Normal rank
@@ Property / cites work @@
+Hadwiger's conjecture is true for almost every graph
+Normal rank
@@ Property / cites work @@
+On the Hadwiger's conjecture for graph products
@@ Property / cites work: On the Hadwiger's conjecture for graph products / rank @@
+Normal rank
@@ Property / cites work @@
+Q4838483
@@ Property / cites work: Q4838483 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph decompositions for cartesian products
@@ Property / cites work: Graph decompositions for cartesian products / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth and logical definability of graph products
+Normal rank
@@ Property / cites work @@
+Finding Large Clique Minors is Hard
@@ Property / cites work: Finding Large Clique Minors is Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for Minimum Weight Vertex Separators
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Clique is hard to approximate within \(n^{1-\epsilon}\)
+Normal rank
@@ Property / cites work @@
+Q4523707
@@ Property / cites work: Q4523707 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
+Normal rank
@@ Property / cites work @@
+Achievable sets, brambles, and sparse treewidth obstructions
+Normal rank
@@ Property / cites work @@
+Graph expansion and the unique games conjecture
@@ Property / cites work: Graph expansion and the unique games conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Q4352948
@@ Property / cites work: Q4352948 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4407447
@@ Property / cites work: Q4407447 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph searching and a min-max theorem for tree-width
+Normal rank
@@ Property / cites work @@
+Clique minors in Cartesian products of graphs
@@ Property / cites work: Clique minors in Cartesian products of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Treewidth of Cartesian Products of Highly Connected Graphs
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2013.08.005
@@ Property / DOI: 10.1016/J.DAM.2013.08.005 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:741743