Characterization of graphs G where G ∈ obs*(H) for some graph H
Zahra Rahimi, M. H. Shirdareh Haghighi, Asma Namazi
Abstract
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 vertices. The set of minimal H-obstructions on |V(H)|+1 vertices is denoted by obs*(H). In question 2 of the paper "Santiago Guzmán-Pro, Full-homomorphisms to paths and cycles, Discrete Mathematics, 347(3):113800, 2024" it is asked if there is a characterization of those graphs G that lie in obs*(H) for some graph H. In this paper, we give a complete answer to this question.
Create a lesson
Related papers
Simple Cayley permutations
Giulio Cerbai, Anders Claesson
Transfer of difference structures: a new semidirect product framework
Sophie Huczynska, Struan McCartney, Carys Williams
Connected Mutual-Visibility in Graphs
Tonny K B, Shikhi M
Decomposing Gorenstein polytopes of large index
Johannes Knupfer, Benjamin Nill
A non-trivial bound for 3AP-intersecting families
Peter Keevash
Solution to a conjecture on integral uniform hypercycles
Joyentanuj Das, Iswar Mahato