Pages that link to "Item:Q2448922"
From MaRDI portal
The following pages link to Computing the differential of a graph: hardness, approximability and exact algorithms (Q2448922):
Displaying 18 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)
- Data reductions and combinatorial bounds for improved approximation algorithms (Q899583) (← links)
- On the differential polynomial of a graph (Q1734931) (← links)
- A proof of a conjecture on the differential of a subcubic graph (Q2004071) (← 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)
- On the differential and Roman domination number of a graph with minimum degree two (Q2410222) (← links)
- On the Complexity Landscape of the Domination Chain (Q2795935) (← links)
- The differential of the strong product graphs (Q5248090) (← links)
- Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs (Q5385974) (← links)
- Minimal Roman dominating functions: extensions and enumeration (Q6043174) (← links)
- Differential in complementary prisms (Q6089069) (← links)
- Minimal Roman dominating functions: extensions and enumeration (Q6547209) (← links)
- Unique response Roman domination versus 2-packing differential in complementary prisms (Q6576774) (← links)
- The differential on graph operator \(\mathrm{R}(G)\) (Q6667363) (← links)
