Tight Upper Bounds on Color Reversal by Local Inversions

Hitendra Kumar, Kumud Singh Porte, R. B. Sandeep

A bicoloration of a graph $G=(V,E)$ is a map $\beta :V\to \{-1,1\}$. A local inversion at a vertex $v$ complements the subgraph induced by the neighbors of $v$ and simultaneously reverse…