Pages that link to "Item:Q533883"
From MaRDI portal
The following pages link to The algorithmic complexity of mixed domination in graphs (Q533883):
Displaying 23 items.
- On the algorithmic complexity of edge total domination (Q300244) (← links)
- Signed mixed Roman domination numbers in graphs (Q328725) (← links)
- \([1,2]\)-sets and \([1,2]\)-total sets in trees with algorithms (Q897596) (← links)
- Mixed Roman domination in graphs (Q1684257) (← links)
- Mixed Dominating Set: a parameterized perspective (Q1687931) (← links)
- On the mixed domination problem in graphs (Q1945934) (← links)
- Mixed domination and 2-independence in trees (Q2132130) (← links)
- Improved budgeted connected domination and budgeted edge-vertex domination (Q2222087) (← links)
- Improved parameterized algorithms and kernels for mixed domination (Q2310753) (← links)
- On the complexity of Mixed Dominating Set (Q2330564) (← links)
- Mixed tree domination number (Q2911966) (← links)
- On the complexity of variations of mixed domination on graphs<sup>†</sup> (Q2958268) (← links)
- Law of large numbers for a two-dimensional class cover problem (Q5030235) (← links)
- Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination (Q5041206) (← links)
- An efficient algorithm for Mixed domination on Generalized Series-Parallel Graphs (Q5124564) (← links)
- The strong domination problem in block graphs and proper interval graphs (Q5207497) (← links)
- Signed mixed dominating functions in complete bipartite graphs (Q5259070) (← links)
- Complexity and algorithms for semipaired domination in graphs (Q5918285) (← links)
- Upper and lower bounds on approximating weighted mixed domination (Q5918569) (← links)
- An efficient algorithm for distance total domination in block graphs (Q5963627) (← links)
- (Q6089653) (← links)
- Total mixed domination in graphs (Q6101468) (← links)
- Explicit construction of mixed dominating sets in generalized Petersen graphs (Q6646750) (← links)
