Domination in partitioned graphs
From MaRDI portal
Recommendations
Cited in
(21)- Total domination in partitioned graphs
- Domination, packing and excluded minors
- Bipartization of graphs
- Distance domination in partitioned graphs
- A new lower bound on the independence number of a graph and applications
- scientific article; zbMATH DE number 2061963 (Why is no real title available?)
- scientific article; zbMATH DE number 1472171 (Why is no real title available?)
- scientific article; zbMATH DE number 2170484 (Why is no real title available?)
- scientific article; zbMATH DE number 6311742 (Why is no real title available?)
- Bipartite Domination in Graphs
- A note on the independent domination number versus the domination number in bipartite graphs.
- Dominator partitions of graphs
- Acyclic dominating partitions
- Transversals in regular uniform hypergraphs
- The Tuza–Vestergaard Theorem
- Extensions and applications of the Tuza-Vestergaard theorem
- Transversals in 4-uniform hypergraphs
- Domination in partitioned graphs with minimum degree two
- Independence in 5-uniform hypergraphs
- Total domination in partitioned trees and partitioned graphs with minimum degree two
- Domination in bipartite graphs
This page was built for publication: Domination in partitioned graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4786799)