1 citations · 1 across the 1 of their papers we have counts for
2 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★ 1 cited
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…