Complexity issues on bounded restrictive H-coloring

3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

We consider a bounded version of the restrictive and the restrictive list H-coloring problem in which the number of pre-images of certain vertices of H is taken as parameter. We consider the decision and the counting versions, as well as, further variations of those problems. We provide complexity results identifying the cases when the problems are NP-complete or #P-complete or polynomial time solvable. We conclude stating some open problems. © 2007 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Díaz, J., Serna, M., & Thilikos, D. M. (2007). Complexity issues on bounded restrictive H-coloring. Discrete Mathematics, 307(16), 2082–2093. https://doi.org/10.1016/j.disc.2005.12.058

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free