Complexity of 2-rainbow total domination problem
From MaRDI portal
Publication:6607381
Recommendations
- Total 2-rainbow domination in graphs: complexity and algorithms
- Complexity of \(k\)-rainbow independent domination and some results on the lexicographic product of graphs
- scientific article; zbMATH DE number 2104725
- Total 2-rainbow domination numbers of trees
- Bounding the \(k\)-rainbow total domination number
Cites work
- scientific article; zbMATH DE number 3141016 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- A new graph product and its spectrum
- A survey of selected recent results on total domination in graphs
- Bounding the \(k\)-rainbow total domination number
- Domination-related parameters in rooted product graphs
- On \(k\)-rainbow domination in middle graphs
- On the 2-rainbow domination in graphs
- Rainbow domination in graphs
- Rainbow domination in the lexicographic product of graphs
- Rainbow domination on trees
- Structures of domination in graphs
- Topics in Domination in Graphs
- Total domination in generalized prisms and a new domination invariant
- Trees with equal total domination and 2-rainbow domination numbers
This page was built for publication: Complexity of 2-rainbow total domination problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6607381)