A general method in the theory of domination in graphs
From MaRDI portal
Publication:3066944
Recommendations
- Generalized domination and efficient domination in graphs
- Theory of domination in graphs
- A generalization of domination critical graphs
- scientific article; zbMATH DE number 1161247
- scientific article; zbMATH DE number 1095171
- On Domination in Graphs
- Generalized perfect domination in graphs
- Some results on domination in graphs
- scientific article; zbMATH DE number 1161346
- scientific article; zbMATH DE number 1002450
Cites work
Cited in
(8)- scientific article; zbMATH DE number 6707348 (Why is no real title available?)
- \(k\)-domination and \(k\)-independence in graphs: A survey
- An integer programming approach for solving a generalized version of the Grundy domination number
- Extremal graphs for a new upper bound on domination parameters in graphs
- scientific article; zbMATH DE number 3929037 (Why is no real title available?)
- Bounds on the connected \(k\)-domination number in graphs
- Connected domination
- Multiple domination
This page was built for publication: A general method in the theory of domination in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066944)