Twin-width VIII: delineation and win-wins

Autor: Bonnet, Édouard, Chakraborty, Dibyayan, Kim, Eun Jung, Köhler, Noleen, Lopes, Raul, Thomassé, Stéphan

Publikováno v: The International Symposium on Parameterized and Exact Computation (IPEC)
The International Symposium on Parameterized and Exact Computation (IPEC), Sep 2022, Potsdam, Germany

We introduce the notion of delineation. A graph class C is said delineated by twin-width (or simply, delineated) if for every hereditary closure D of a subclass of C, it holds that D has bounded twin-width if and only if D is monadically dependent. A

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0d899c4cb1fbd0a84ca990582c8d44d1
https://hal.science/hal-03956502