Pages that link to "Item:Q5918107"
From MaRDI portal
The following pages link to NP-completeness results for partitioning a graph into total dominating sets (Q5918107):
Displaying 6 items.
- A note on non-dominating set partitions in graphs (Q339496) (← links)
- Finding domatic partitions in infinite graphs (Q888598) (← links)
- Complexity of fall coloring for restricted graph classes (Q5918283) (← links)
- NP-completeness results for partitioning a graph into total dominating sets (Q5920155) (← links)
- On domatic and total domatic numbers of Cartesian products of graphs (Q6102218) (← links)
- Disjoint total dominating sets in near‐triangulations (Q6142659) (← links)