Pages that link to "Item:Q5920155"
From MaRDI portal
The following pages link to NP-completeness results for partitioning a graph into total dominating sets (Q5920155):
Displaying 6 items.
- A note on non-dominating set partitions in graphs (Q339496) (← links)
- Finding domatic partitions in infinite graphs (Q888598) (← links)
- Coupon-coloring and total domination in Hamiltonian planar triangulations (Q1756106) (← links)
- Role colouring graphs in hereditary classes (Q2034782) (← links)
- NP-completeness results for partitioning a graph into total dominating sets (Q5918107) (← links)
- Complexity of fall coloring for restricted graph classes (Q5918283) (← links)