Domatic Partition on Several Classes of Graphs
From MaRDI portal
Publication:3167366
Recommendations
- Total \(k\)-domatic partition on some classes of graphs
- Dominator partitions of graphs
- scientific article; zbMATH DE number 6311742
- Domatic partitions of computable graphs
- scientific article; zbMATH DE number 2227473
- Partitioned graphs and domination related parameters
- scientific article; zbMATH DE number 1202982
- Domination partition in graphs
- scientific article; zbMATH DE number 3867385
- On partition graphs
Cited in
(15)- Matched-Factor d-Domatic Coloring of Graphs
- Finding domatic partitions in infinite graphs
- Multi-constructor CMSA for the maximum disjoint dominating sets problem
- The algorithmic complexity of \(k\)-domatic partition of graphs
- Mathematical Foundations of Computer Science 2005
- Complexity of the exact domatic number problem and of the exact conveyor flow shop problem
- A note on the complexity of the total domatic partition problem in graphs
- Domatic partitions of computable graphs
- On the \(b\)-domatic number of graphs
- Total \(k\)-domatic partition on some classes of graphs
- scientific article; zbMATH DE number 6311742 (Why is no real title available?)
- Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction
- The domatic number problem on some perfect graph families
- Constrained domatic bipartition on trees
- NP-completeness results for partitioning a graph into total dominating sets
This page was built for publication: Domatic Partition on Several Classes of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3167366)