Total restrained domination in claw-free graphs with minimum degree at least two
From MaRDI portal
(Redirected from Publication:411852)
Recommendations
- Restrained domination in claw-free graphs with minimum degree at least two
- Total restrained domination in claw-free graphs
- Total domination in claw-free graphs with minimum degree 2
- An upper bound for the total restrained domination number of graphs
- Total restrained domination in graphs with minimum degree two
Cites work
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- An upper bound on the total restrained domination number of a tree
- Bounds on the total restrained domination number of a graph
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs
- On total restrained domination in graphs
- Remarks on restrained domination and total restrained domination in graphs
- Total restrained domination in claw-free graphs
- Total restrained domination in graphs with minimum degree two
- Total restrained domination in trees
Cited in
(9)- On a conjecture involving a bound for the total restrained domination number of a graph
- Restrained and total restrained domination in cographs
- Total restrained domination in claw-free graphs
- Restrained and total restrained domination in graphs
- Claw-free graphs with equal 2-domination and domination numbers
- A probabilistic algorithm for bounding the total restrained domination number of a \(K_{1 , \ell}\) -free graph
- Total domination in claw-free graphs with minimum degree 2
- Total restrained domination in graphs with minimum degree two
- Restrained domination in claw-free graphs with minimum degree at least two
This page was built for publication: Total restrained domination in claw-free graphs with minimum degree at least two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q411852)
