The k-domatic number of a graph
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3815677 (Why is no real title available?)
- scientific article; zbMATH DE number 3970788 (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 1124606 (Why is no real title available?)
- Towards a theory of domination in graphs
Cited in
(22)- On the \(b\)-domatic number of graphs
- Bounds of signless Laplacian spectrum of graphs based on the \(k\)-domination number
- On the \(\{k\}\)-domatic number of graphs
- Bounds on the upper k-domination number and the upper k-star-forming number of a graph
- The algorithmic complexity of \(k\)-domatic partition of graphs
- The p-domination number of complete multipartite graphs
- Bounds on the k-tuple domatic number of a graph
- On k-domatic numbers of graphs
- Multiple domination
- Distance domination in graphs
- The roman k-domatic number of a graph
- scientific article; zbMATH DE number 3970788 (Why is no real title available?)
- scientific article; zbMATH DE number 1124606 (Why is no real title available?)
- scientific article; zbMATH DE number 1792633 (Why is no real title available?)
- Bounds on the l-total k-domatic number of a graph
- The k-conversion number of regular graphs
- The upper domatic number of powers of graphs
- The upper domatic number of a graph
- On domatic number of graphs
- The extended dominating sets in graphs
- \(k\)-domination and \(k\)-independence in graphs: A survey
- The \(\{k\}\)-domatic number of a graph
This page was built for publication: The \(k\)-domatic number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3070140)