%0 Conference Proceedings
%T Rainbow Domination and Related Problems on Some Classes of Perfect Graphs
%+ National Tsing Hua University [Hsinchu] (NTHU)
%+ University of Liverpool
%+ National Taipei University of Business (NTUB)
%A Hon, Wing-Kai
%A Kloks, Ton
%A Liu, Hsiang-Hsuan
%A Wang, Hung-Lung
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 1st International Conference on Theoretical Computer Science (TTCS)
%C Tehran, Iran
%Y Mohammed Taghi Hajiaghayi
%Y Mohammad Reza Mousavi
%3 Topics in Theoretical Computer Science
%V LNCS-9541
%P 121-134
%8 2015-08-26
%D 2015
%R 10.1007/978-3-319-28678-5_9
%Z Computer Science [cs]Conference papers
%X Let $k \in \mathbb {N}$ and let G be a graph. A function $f: V(G) \rightarrow 2^{[k]}$ is a rainbow function if, for every vertex x with $f(x)=\varnothing $f(x)=∅, $f(N(x)) =[<i>k</i>]$, where [<i>k</i>] denotes the integers ranging from 1 to <i>k</i>. The rainbow domination number $\gamma _{kr}(G)$ is the minimum of $\sum _{x \in V(G)} |f(x)|$ over all rainbow functions. We investigate the rainbow domination problem for some classes of perfect graphs.
%G English
%Z TC 1
%Z WG 1.8
%2 https://inria.hal.science/hal-01446271/document
%2 https://inria.hal.science/hal-01446271/file/385217_1_En_9_Chapter.pdf
%L hal-01446271
%U https://inria.hal.science/hal-01446271
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-LNCS-9541
%~ IFIP-WG1-8
%~ IFIP-TTCS