Pages that link to "Item:Q1283793"
From MaRDI portal
The following pages link to On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793):
Displaying 21 items.
- Signed mixed Roman domination numbers in graphs (Q328725) (← links)
- Independent dominating set problem revisited (Q476836) (← links)
- The algorithmic complexity of mixed domination in graphs (Q533883) (← links)
- Vertex and edge covers with clustering properties: Complexity and algorithms (Q1026225) (← links)
- Subset sum problems with digraph constraints (Q1631654) (← links)
- On the complexity of the smallest grammar problem over fixed alphabets (Q2035481) (← links)
- Extension and its price for the connected vertex cover problem (Q2072064) (← links)
- Mixed domination and 2-independence in trees (Q2132130) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- Small \(k\)-pyramids and the complexity of determining \(k\) (Q2253900) (← links)
- Improved parameterized algorithms and kernels for mixed domination (Q2310753) (← links)
- On complementary coverage of \({\Omega}_n(T)\) (Q2437354) (← links)
- Total coloring and total matching: polyhedra and facets (Q2673562) (← links)
- On the Complexity Landscape of the Domination Chain (Q2795935) (← links)
- On the complexity of variations of mixed domination on graphs<sup>†</sup> (Q2958268) (← links)
- NP-completeness of the independent dominating set problem in the class of cubic planar bipartite graphs (Q5090153) (← links)
- Weighted Upper Edge Cover: Complexity and Approximability (Q5216282) (← links)
- Signed mixed dominating functions in complete bipartite graphs (Q5259070) (← links)
- Upper and lower bounds on approximating weighted mixed domination (Q5918569) (← links)
- (Q6089653) (← links)
- Explicit construction of mixed dominating sets in generalized Petersen graphs (Q6646750) (← links)
