Domination in partitioned graphs with minimum degree two
From MaRDI portal
Publication:870974
Recommendations
Cites work
- scientific article; zbMATH DE number 1055145 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 2061963 (Why is no real title available?)
- scientific article; zbMATH DE number 1472171 (Why is no real title available?)
- Bounds related to domination in graphs with minimum degree two
- Domination in graphs with minimum degree two
- Domination in partitioned graphs
- Graphs with large total domination number
Cited in
(11)- Total domination in partitioned graphs
- Domination number in graphs with minimum degree two
- scientific article; zbMATH DE number 837049 (Why is no real title available?)
- Dominator partitions of graphs
- Domination in partitioned graphs
- Domination in graphs with minimum degree two
- Partitioned graphs and domination related parameters
- Almost well-dominated bipartite graphs with minimum degree at least two
- scientific article; zbMATH DE number 1472171 (Why is no real title available?)
- Distance domination in partitioned graphs
- Total domination in partitioned trees and partitioned graphs with minimum degree two
This page was built for publication: Domination in partitioned graphs with minimum degree two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q870974)
