Colorings and homomorphisms of degenerate and bounded degree graphs Original Research Article

We are interested here in homomorphisms of undirected graphs and relate them to graph degeneracy and bounded degree property. Our main result reads that both in the abundance of counterexamples and from the complexity point of view the Brooksʹs theorem and first fit algorithm are the ‘only’ easy cases.