Pages that link to "Item:Q2197403"
From MaRDI portal
The following pages link to Partitioning vertices into in- and out-dominating sets in digraphs (Q2197403):
Displaying 5 items.
- Partitioning the vertex set of an acyclic directed graph into convex subsets (Q583239) (← links)
- Out-degree reducing partitions of digraphs (Q1704574) (← links)
- Partitioning the vertices of a cubic graph into two total dominating sets (Q2030435) (← links)
- On the parameterized complexity of 2-partitions (Q2205943) (← links)
- The algorithmic complexity of domination digraphs (Q2895354) (← links)