3 papers
math.CO2026
A linear upper bound on the number of moves required for independent set reconfiguration with two sliding tokens
Nived J. M., Mathew C. Francis
We consider the problem of shifting two tokens placed on nonadjacent vertices of a graph on vertices to two nonadjacent vertices of using a sequence of to…
cs.DM2025
Adjacent vertex distinguishing total coloring of 3-degenerate graphs
Diptimaya Behera, Mathew C. Francis, Sreejith K. Pallathumadam
A total coloring of a simple undirected graph is an assignment of colors to its vertices and edges such that the colors given to the vertices form a proper vertex coloring, the…
cs.DM2024
Token sliding independent set reconfiguration on block graphs
Mathew C. Francis, Veena Prabhakaran
Let be an independent set of a simple undirected graph . Suppose that each vertex of has a token placed on it. The tokens are allowed to be moved, one at a time, by slid…