Enclaveless sets and MK-Systems
From MaRDI portal
Publication:3853669
DOI10.6028/jres.082.019zbMath0421.05053OpenAlexW2331245033MaRDI QIDQ3853669
Publication date: 1977
Published in: Journal of Research of the National Bureau of Standards (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.6028/jres.082.019
Related Items (17)
Relations between the differential and parameters in graphs ⋮ The differential of the line graph \(\mathcal{L} (G)\) ⋮ Using maximality and minimality conditions to construct inequality chains ⋮ Domination chain: characterisation, classical complexity, parameterised complexity and approximability ⋮ Total $k$-domination in strong product graphs ⋮ Data reductions and combinatorial bounds for improved approximation algorithms ⋮ Computing the differential of a graph: hardness, approximability and exact algorithms ⋮ Combinatorics for smaller kernels: the differential of a graph ⋮ On the differential polynomial of a graph ⋮ The enclaveless competition game ⋮ $k$-distance enclaveless number of a graph ⋮ Competition-reachability of a graph ⋮ Lower bounds on the differential of a graph ⋮ Weighted Upper Edge Cover: Complexity and Approximability ⋮ The differential of the strong product graphs ⋮ \(\beta\)-differential of a graph ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters
This page was built for publication: Enclaveless sets and MK-Systems
