Orientations and -colourings of graphs
We provide the list of all paths with at most arcs with the property that if a graph admits an orientation such that one of the paths in our list admits no homomorphism to , then is -colourable.
We provide the list of all paths with at most arcs with the property that if a graph admits an orientation such that one of the paths in our list admits no homomorphism to , then is -colourable.
Page 1