Twin-width and types
From MaRDI portal
Cited in
(7)- Twin-width of planar graphs is at most 8, and some related bounds
- Sparse graphs of twin-width 2 have bounded tree-width
- Improved bounds for twin-width parameter variants with algorithmic applications to counting graph colorings
- Advances in algorithmic meta theorems (invited paper)
- Solving partial dominating set and related problems using twin-width
- On the twin-width of smooth manifolds
- Approximating highly inapproximable problems on graphs of bounded twin-width
This page was built for publication: Twin-width and types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6560925)