Charles Explorer logo
🇨🇿

Colored homomorphism of Colored and Mixed Graphs

Publikace na Matematicko-fyzikální fakulta |
2000

Tento text není v aktuálním jazyce dostupný. Zobrazuje se verze "en".Abstrakt

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.