Extremal H-colorings of trees and 2-connected graphs

John Engbers, David Galvin

For graphs $G$ and $H$, an $H$-coloring of $G$ is an adjacency preserving map from the vertices of $G$ to the vertices of $H$. $H$-colorings generalize such notions as independent…