Preprint
Aug 2026
Characterization of graphs $G$ where $G \in \mathrm{obs}^*(H)$ for some graph $H$
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$-obstruction if it has no full-homomorphism to $H$ but every proper vertex induced subgraph of $G$ does. Such graphs can have at most $|V(H)|+1$ ver...
Z. Rahimi, M. H. Shirdareh-Haghighi, Asma Namazi Department of Mathematics et al.
· 0 citations