1. Bounds for the twin-width of graphs;Ahn;SIAM J. Discrete Math.,2022
2. Twin-width is linear in the poset width;Balabán,2021
3. Deciding twin-width at most 4 is NP-complete;Bergé,2022
4. Graphs of bounded cliquewidth are polynomially χ-bounded;Bonamy;Adv. Combin.,2020
5. Max independent set, min dominating set, and coloring;Bonnet,2021