On (1,2)-domination in cubic graphs
From MaRDI portal
Publication:2043407
DOI10.1016/j.disc.2021.112546zbMath1476.05152OpenAlexW3184876347MaRDI QIDQ2043407
Publication date: 2 August 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2021.112546
Cites Work
- Locating-total domination in claw-free cubic graphs
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Covering all cliques of a graph
- Small transversals in hypergraphs
- Upper bounds for \(k\)-tuple (total) domination numbers of regular graphs
- Strong Transversals in Hypergraphs and Double Total Domination in Graphs
- Hypergraphs with large transversal number and with edge sizes at least 3
- Some remarks on domination
- Total Domination in Graphs
- Structures of Domination in Graphs
- Topics in Domination in Graphs
- On domination and annihilation in graphs with claw-free blocks
- Unnamed Item
This page was built for publication: On (1,2)-domination in cubic graphs