Upper bound on 3-rainbow domination in graphs with minimum degree 2
From MaRDI portal
Publication:1662645
DOI10.1016/j.disopt.2018.02.004zbMath1506.05158OpenAlexW2795805246WikidataQ130028739 ScholiaQ130028739MaRDI QIDQ1662645
Masaki Koyanagi, Michitaka Furuya, Maho Yokota
Publication date: 20 August 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2018.02.004
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds on the 2-rainbow domination number of graphs
- On rainbow domination numbers of graphs
- Some results on Vizing's conjecture and related problems
- Bounds on weak Roman and 2-rainbow domination numbers
- Rainbow domination in graphs
- Rainbow domination on trees
- Note on 2-rainbow domination and Roman domination in graphs
- On graphs having domination number half their order
- Difference between 2-rainbow domination and roman domination in graphs
- A note on total domination and 2-rainbow domination in graphs
- General bounds on rainbow domination numbers
- On the 2-rainbow domination in graphs
- The k-rainbow domatic number of a graph
- Domination in graphs with minimum degree two
- Domination-balanced graphs
This page was built for publication: Upper bound on 3-rainbow domination in graphs with minimum degree 2