Domatic Partition on Several Classes of Graphs

DOI10.1007/978-3-642-31770-5_22zbMath1301.05269OpenAlexW1895777545WikidataQ62041791 ScholiaQ62041791MaRDI QIDQ3167366

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

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

Multi-constructor CMSA for the maximum disjoint dominating sets problem ⋮ On the \(b\)-domatic number of graphs ⋮ 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