Rainbow domination and related problems on strongly chordal graphs
From MaRDI portal
(Redirected from Publication:2446318)
Recommendations
Cites work
- \(k\)-tuple domination in graphs
- A note on obtaining \(k\) dominating sets from a \(k\)-dominating function on a tree
- A simple linear time algorithm for the domatic partition problem on strongly chordal graphs
- Algorithmic aspect of k-tuple domination in graphs.
- Characterizations of strongly chordal graphs
- Characterizations of totally balanced matrices
- Doubly lexical ordering of dense 0--1 matrices
- Doubly Lexical Orderings of Matrices
- Efficient (j,k)-domination
- Hardness results and approximation algorithms of \(k\)-tuple domination in graphs
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 5531984 (Why is no real title available?)
- scientific article; zbMATH DE number 1302196 (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?)
- scientific article; zbMATH DE number 1124600 (Why is no real title available?)
- scientific article; zbMATH DE number 867701 (Why is no real title available?)
- scientific article; zbMATH DE number 3284071 (Why is no real title available?)
- Nordhaus-Gaddum inequalities for domination in graphs
- On dominating the Cartesian product of a graph and K2
- On integer domination in graphs and Vizing-like problems
- On the 2-rainbow domination in graphs
- Paired-domination of Cartesian products of graphs and rainbow domination
- Rainbow domination in graphs
- Rainbow domination on trees
- The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
- The upper bound on \(k\)-tuple domination numbers of graphs
- Three Partition Refinement Algorithms
- Totally-Balanced and Greedy Matrices
Cited in
(9)- Domination parameters with number 2: interrelations and algorithmic consequences
- Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs
- Roman \(\{k\}\)-domination in trees and complexity results for some classes of graphs
- Rainbow domination in graphs
- On the \(k\)-rainbow domination in graphs with bounded tree-width
- Strong Inapproximability Results on Balanced Rainbow-Colorable Hypergraphs
- A note of 2-rainbow edge domination numbers of graphs
- The characterizations and complexity of Roman \{2\}-domination number and 2-domination number in graphs
- Rainbow domination on trees
This page was built for publication: Rainbow domination and related problems on strongly chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2446318)