Abstract
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph theory, e.g., directed graph homomorphism and list colorings. We study the border between tractability and intractability for both variants.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have