Total restrained domination in claw-free graphs
From MaRDI portal
Publication:2268763
DOI10.1007/S10878-008-9161-1zbMath1201.05070OpenAlexW1979496890MaRDI QIDQ2268763
Publication date: 9 March 2010
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-008-9161-1
Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (3)
Total restrained domination in claw-free graphs with minimum degree at least two ⋮ Total restrained domination in graphs ⋮ Total restrained domination in cubic graphs
Cites Work
- Unnamed Item
- Total restrained domination in trees
- Total restrained domination in graphs with minimum degree two
- On equality in an upper bound for the restrained and total domination numbers of a graph
- Total restrained domination numbers of trees
- Trees with equal domination and restrained domination numbers
- On total restrained domination in graphs
- Remarks on restrained domination and total restrained domination in graphs
- Total domination in graphs
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Trees with restrained domination and total restrained domination numbers
This page was built for publication: Total restrained domination in claw-free graphs