Domatic Partition on Several Classes of Graphs
DOI10.1007/978-3-642-31770-5_22zbMATH Open1301.05269OpenAlexW1895777545WikidataQ62041791 ScholiaQ62041791MaRDI QIDQ3167366FDOQ3167366
Sheung-Hung Poon, William Chung-Kung Yen, Chin-Ting Ung
Publication date: 2 November 2012
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31770-5_22
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
Deterministic network models in operations research (90B10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (10)
- Mathematical Foundations of Computer Science 2005
- The domatic number problem on some perfect graph families
- Constrained domatic bipartition on trees
- Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction
- Multi-constructor CMSA for the maximum disjoint dominating sets problem
- Complexity of the exact domatic number problem and of the exact conveyor flow shop problem
- Title not available (Why is that?)
- Matched-Factor d-Domatic Coloring of Graphs
- NP-completeness results for partitioning a graph into total dominating sets
- On the \(b\)-domatic number of graphs
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)
