Restrained and total restrained domination in cographs
From MaRDI portal
Publication:2151385
DOI10.1007/978-3-030-93176-6_36zbMath1505.05105OpenAlexW4205489636MaRDI QIDQ2151385
Publication date: 1 July 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-93176-6_36
Cites Work
- Unnamed Item
- Unnamed Item
- Total restrained domination in claw-free graphs with minimum degree at least two
- Restrained domination in graphs
- Secure domination in cographs
- On total restrained domination in graphs
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs
This page was built for publication: Restrained and total restrained domination in cographs