A polynomial-time algorithm for rainbow domination in trees

MaRDI QIDQ5367625zbMATH OpenFDO

Authors Kan Wang, Jia Ding, Chao Wang

Publication date 20 October 2017

zbMATH Keywords

polynomial-time algorithmrainbow dominationtree

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Rainbow domination on trees
• Rainbow domination in graphs
• Rainbow edge-coloring and rainbow domination
• On the \(k\)-rainbow domination in graphs with bounded tree-width
• On rainbow domination numbers of graphs

Cited in

(2)

• Rainbow edge-coloring and rainbow domination
• On the \(k\)-rainbow domination in graphs with bounded tree-width

This page was built for publication: A polynomial-time algorithm for rainbow domination in trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5367625)