The following pages link to (Q5463534):
Displaying 11 items.
- On the difference between chromatic number and dynamic chromatic number of graphs (Q442373) (← links)
- Disjoint dominating and total dominating sets in graphs (Q602677) (← links)
- Dominating and total dominating partitions in cubic graphs (Q657306) (← links)
- A survey of selected recent results on total domination in graphs (Q998491) (← links)
- Remarks about disjoint dominating sets (Q1045182) (← links)
- Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications (Q1799219) (← links)
- Pairs of disjoint dominating sets in connected cubic graphs (Q1926047) (← links)
- Pairs of disjoint dominating sets and the minimum degree of graphs (Q1959712) (← links)
- Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets (Q2570105) (← links)
- Multiple Domination (Q3384609) (← links)
- Partitioning the Vertices of a Graph into Two Total Dominating Sets (Q5236035) (← links)
