The following pages link to Enclaveless sets and MK-Systems (Q3853669):
Displaying 17 items.
- Relations between the differential and parameters in graphs (Q283724) (← links)
- Combinatorics for smaller kernels: the differential of a graph (Q476877) (← links)
- Lower bounds on the differential of a graph (Q713137) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Data reductions and combinatorial bounds for improved approximation algorithms (Q899583) (← links)
- Using maximality and minimality conditions to construct inequality chains (Q1377679) (← links)
- On the differential polynomial of a graph (Q1734931) (← links)
- The differential of the line graph \(\mathcal{L} (G)\) (Q2172393) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- \(\beta\)-differential of a graph (Q2333412) (← links)
- Total $k$-domination in strong product graphs (Q2420408) (← links)
- Computing the differential of a graph: hardness, approximability and exact algorithms (Q2448922) (← links)
- Competition-reachability of a graph (Q2488931) (← links)
- $k$-distance enclaveless number of a graph (Q5102423) (← links)
- The enclaveless competition game (Q5156013) (← links)
- Weighted Upper Edge Cover: Complexity and Approximability (Q5216282) (← links)
- The differential of the strong product graphs (Q5248090) (← links)
