Pages that link to "Item:Q5920155"

The following pages link to NP-completeness results for partitioning a graph into total dominating sets (Q5920155):

Displaying 3 items.

• 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)