On the k-rainbow domination in graphs with bounded tree-width
From MaRDI portal
Publication:5061680
DOI10.5614/ejgta.2021.9.2.4zbMath1482.05256OpenAlexW3205905972MaRDI QIDQ5061680
Mohsen Alambardar Meybodi, Pouyeh Sharifani, Ali Shakiba, Mohammad Reza Hooshmandasl
Publication date: 14 March 2022
Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5614/ejgta.2021.9.2.4
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact algorithms for dominating set
- Rainbow domination in graphs
- 2-rainbow domination in generalized petersen graphs \(P(n,3)\)
- Rainbow domination on trees
- Note on 2-rainbow domination and Roman domination in graphs
- 2-rainbow domination of generalized Petersen graphs \(P(n,2)\)
- Graph minors. I. Excluding a forest
- Difference between 2-rainbow domination and roman domination in graphs
- Rainbow domination and related problems on strongly chordal graphs
- Rainbow domination in the lexicographic product of graphs
- A tight upper bound for 2-rainbow domination in generalized Petersen graphs
- On the 2-rainbow domination in graphs
- Rainbow Domination and Related Problems on Some Classes of Perfect Graphs
- The Fine Details of Fast Dynamic Programming over Tree Decompositions
- On exact algorithms for treewidth
- Paired-domination of Cartesian products of graphs and rainbow domination
- Graph minors. II. Algorithmic aspects of tree-width
- Complexity of Finding Embeddings in a k-Tree
- On the complexity of some hop domination parameters
- Rainbow perfect domination in lattice graphs
This page was built for publication: On the k-rainbow domination in graphs with bounded tree-width
