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.
Quantum4, 305 (2020).https://doi
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Tight Upper Bounds on Color Reversal by Local Inversions
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.