Twin-width and types

DOI10.4230/LIPICS.ICALP.2022.123MaRDI QIDQ6560925zbMATH OpenFDO

Authors Jakub Gajarský, Michał Pilipczuk, Wojciech Przybyszewski, Szymon Toruńczyk

Publication date 24 June 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2022.123

zbMATH Keywords

enumerationFO logicmodel checkingquery answeringtwin-width

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cited in

(6)

• 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

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)