Charles Explorer logo
🇬🇧

Colored homomorphism of Colored and Mixed Graphs

Publication at Faculty of Mathematics and Physics |
2000

Abstract

Generalizing earlier results of Sopena, Raspaud and Alon, Marshall it is established that colored mixed (i.e. both undirected and oriented) graphs have bounded chromatic number which respects color and orientations.