3 papers
math.CO2026
Weisfeiler-Leman on graphs of small twin-width
Irene Heinrich, Moritz Lichter, Klara Pakhomenko +1
Twin-width is a graph parameter introduced in the context of first-order model checking, and has since become a central parameter in algorithmic graph theory. While many algorithmi…
math.CO2025
On the twin-width of near-regular graphs
Irene Heinrich, Ferdinand Ihringer, Simon RaÃmann +1
Twin-width is a recently introduced graph parameter based on the repeated contraction of near-twins. It has shown remarkable utility in algorithmic and structural graph theory, as…
math.CO2024
Twin-width of graphs with tree-structured decompositions
Irene Heinrich, Simon RaÃmann
The twin-width of a graph measures its distance to co-graphs and generalizes classical width concepts such as tree-width or rank-width. Since its introduction in 2020 (Bonnet et. a…