Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (1)

Search Parameters:
Keywords = domatic number

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
19 pages, 482 KB  
Article
The Domatic Partition Problem in Separable Graphs
by Mercedes Landete and José Luis Sainz-Pardo
Mathematics 2022, 10(4), 640; https://doi.org/10.3390/math10040640 - 18 Feb 2022
Cited by 1 | Viewed by 2878
Abstract
The domatic partition problem consists of partitioning a given graph into a maximum number of disjoint dominating sets. This problem is related with the domatic number problem, which consists of quantifying this maximum number of disjoint dominating sets. Both problems were proved to [...] Read more.
The domatic partition problem consists of partitioning a given graph into a maximum number of disjoint dominating sets. This problem is related with the domatic number problem, which consists of quantifying this maximum number of disjoint dominating sets. Both problems were proved to be NP-complete. In this paper, we present a decomposition algorithm for finding a domatic partition on separable graphs, that is, on graphs with blocks, and as a consequence, its domatic number, highly reducing the computational complexity. Computational results illustrate the benefits of the block decomposition algorithm. Full article
Show Figures

Figure 1

Back to TopTop