Mathew C. Francis

activity

20242026

collaborators

3 papers

math.CO2026

Characterization of graphs $G$ where $G \in obs^{*} (H)$ for some graph $H$

Zahra Rahimi, M. H. Shirdareh Haghighi, Asma Namazi

A full-homomorphism from a graph $G$ to a graph $H$ is a function on vertex sets that preserves adjacency and non-adjacency of vertices. A graph $G$ is called a minimal $H$ -obstruc…

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 $G$ 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 $S$ be an independent set of a simple undirected graph $G$ . Suppose that each vertex of $S$ has a token placed on it. The tokens are allowed to be moved, one at a time, by slid…

Characterization of graphs G where G∈obs∗(H) for some graph H

Adjacent vertex distinguishing total coloring of 3-degenerate graphs

Token sliding independent set reconfiguration on block graphs

Characterization of graphs $G$ where $G \in obs^{*} (H)$ for some graph $H$