Proves a tight upper bound of 3n local inversions suffices to transform any bicoloring to any other in graphs on n vertices without isolated vertices, with matching lower bounds for complete graphs and stars.
37 Sang-il Oum and Paul D
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Approximating twin-width is FPT parameterized by treedepth via oriented twin-width, and exact twin-width computation is FPT parameterized by vertex integrity.
citing papers explorer
-
Computing Twin-Width via Treedepth and Vertex Integrity
Approximating twin-width is FPT parameterized by treedepth via oriented twin-width, and exact twin-width computation is FPT parameterized by vertex integrity.