Complexity of 2-rainbow total domination problem
From MaRDI portal
Publication:6607381
DOI10.1007/S40840-024-01747-8MaRDI QIDQ6607381FDOQ6607381
Authors: Tadeja Kraner Šumenjak, Aleksandra Tepeh 
Publication date: 18 September 2024
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
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
Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rainbow domination in the lexicographic product of graphs
- On the 2-rainbow domination in graphs
- Title not available (Why is that?)
- Rainbow domination in graphs
- A survey of selected recent results on total domination in graphs
- A new graph product and its spectrum
- Rainbow domination on trees
- Bounding the \(k\)-rainbow total domination number
- Domination-related parameters in rooted product graphs
- Topics in Domination in Graphs
- Total domination in generalized prisms and a new domination invariant
- Structures of domination in graphs
- Trees with equal total domination and 2-rainbow domination numbers
- On \(k\)-rainbow domination in middle graphs
Cited In (1)
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)
