Gupta, Arvind, van den Heuvel, Jan, Manuch, Jan, Stacho, Ladislav and Zhao, Xiaohong (2008) On the complexity of ordered colorings. SIAM journal on discrete mathematics, 22 (2). pp. 832-847. ISSN 0895-4801
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.
|Additional Information:||© 2008 Society for Industrial and Applied Mathematics|
|Library of Congress subject classification:||Q Science > QA Mathematics|
|Sets:||Departments > Mathematics|
|Date Deposited:||18 Feb 2009 12:11|
Actions (login required)
|Record administration - authorised staff only|