In this paper, we prove that the harmonious coloring problem is NP-complete for connected interval and permutation graphs. Given a simple graph G, a harmonious coloring of G is a ...
Katerina Asdre, Kyriaki Ioannidou, Stavros D. Niko...
Recent interest in region based image coding has given rise to graph coloring based partition encoding methods. These methods are based on the four color theorem for planar graphs...
Techniques for color-based tracking of faces or hands often assume a static skin color model. However, skin color perceived by a camera can change when lighting changes. In common...
Maricor Soriano, Birgitta Martinkauppi, Sami Huovi...
A graph is said to be uniquely list colorable, if it admits a list assignment which induces a unique list coloring. We study uniquely list colorable graphs with a restriction on t...
Yashar Ganjali, Mohammad Ghebleh, Hossein Hajiabol...
—This work aims at investigating the influence of luminance information and environment illumination on skin classification. We explore Bayesian approaches to perform automatic...
Diogo Kuiaski, Hugo Vieira Neto, Gustavo B. Borba,...