Degree-based treewidth lower bounds
From MaRDI portal
Recommendations
Cited in
(12)- On switching classes, NLC-width, cliquewidth and treewidth
- A New Lower Bound for Tree-Width Using Maximum Cardinality Search
- An Experimental Study of the Treewidth of Real-World Graph Data
- Contraction and Treewidth Lower Bounds
- Searching for a Visible, Lazy Fugitive
- Contraction and treewidth lower bounds
- Algorithms – ESA 2005
- Treewidth computations. II. Lower bounds
- An improved spectral lower bound of treewidth
- Treewidth of generalized Hamming graph, bipartite Kneser graph and generalized Petersen graph
- Treewidth lower bounds with brambles
- On the maximum cardinality search lower bound for treewidth
This page was built for publication: Degree-based treewidth lower bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710010)