Bounding the \(k\)-rainbow total domination number
From MaRDI portal
Publication:2032845
DOI10.1016/j.disc.2021.112425zbMath1466.05169arXiv2003.09470OpenAlexW3158039980MaRDI QIDQ2032845
Kerry Ojakian, Riste Škrekovski, Aleksandra Tepeh Horvat
Publication date: 14 June 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.09470
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On rainbow domination numbers of graphs
- (Total) domination in prisms
- Some results on Vizing's conjecture and related problems
- Rainbow domination in graphs
- Rainbow domination on trees
- Note on 2-rainbow domination and Roman domination in graphs
- A survey of selected recent results on total domination in graphs
- An inequality related to Vizing's conjecture
- A note on domination and total domination in prisms
- Total domination in generalized prisms and a new domination invariant
- Rainbow domination in the lexicographic product of graphs
- On the 2-rainbow domination in graphs
- Vizing's conjecture: a survey and recent results
- Total domination in graphs
- On dominating the Cartesian product of a graph and K2
- Trees with equal total domination and 2-rainbow domination numbers