Restrained bondage in graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2131198 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Bounds on the bondage number of a graph
- Domination alteration sets in graphs
- Graphs with large restrained domination number
- New results about the bondage number of a graph
- Restrained domination in graphs
- Restrained domination in graphs with minimum degree two
- Restrained domination in trees
- The bondage number of a graph
Cited in
(17)- On the complexity of the outer-connected bondage and the outer-connected reinforcement problems
- Total restrained bondage in graphs
- Restrained reinforcement number in graphs
- The \(p\)-bondage number of trees
- The algorithmic complexity of bondage and reinforcement problems in bipartite graphs
- The restrained rainbow bondage number of a graph
- On the complexity of the bondage and reinforcement problems
- Restrained {2}-domination in graphs
- Restrained Italian bondage number in graphs
- scientific article; zbMATH DE number 1124610 (Why is no real title available?)
- Complexity and bounds for disjunctive total bondage
- On bondage numbers of graphs: a survey with some comments
- Upper bounds for domination related parameters in graphs on surfaces
- Bondage number of mesh networks
- The total bondage number of grid graphs
- Restrained bondage number of a graph
- On the Roman bondage number of a graph
This page was built for publication: Restrained bondage in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998423)