P. Hell

Full homomorphisms to graph classes

Given a family of graphs $\mathcal{F}$, we define a graph $G$ to be fully $\mathcal{F}$-colourable if $G$ admits a full homomorphism to some $F$ in $\mathcal{F}$. We approach the problem of determining when a graph is fully $\mathcal{F}$-colourable in terms of minimal forbidden induced subgraphs. We provide general res...