Improved Bounds for Twin-Width Parameter Variants with Algorithmic Applications to Counting Graph Colorings
Crossref DOI link: https://doi.org/10.1007/s00224-025-10233-y
Published Online: 2026-02-24
Published Print: 2026-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Baril, Ambroise
Couceiro, Miguel
Lagerkvist, Victor
Funding for this research was provided by:
Linköping University
Text and Data Mining valid from 2026-02-24
Version of Record valid from 2026-02-24
Article History
Accepted: 24 July 2025
First Online: 24 February 2026
Declarations
:
: The authors declare no competing interests.