Enclaveless sets and MK-Systems

DOI10.6028/JRES.082.019zbMATH Open0421.05053OpenAlexW2331245033MaRDI QIDQ3853669FDOQ3853669

Authors: Peter Slater 

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

zbMATH Keywords

dominating settransversalhypergraphenclavenessKönig-systemMenger-systemMK-system

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (05C99)

Cited In (18)

• On the differential polynomial of a graph
• Relations between the differential and parameters in graphs
• Combinatorics for smaller kernels: the differential of a graph
• Bibliography on domination in graphs and some basic definitions of domination parameters
• Lower bounds on the differential of a graph
• \(\beta\)-differential of a graph
• Competition-reachability of a graph
• Domination chain: characterisation, classical complexity, parameterised complexity and approximability
• \(k\)-distance enclaveless number of a graph
• Weighted upper edge cover: complexity and approximability
• The enclaveless competition game
• Data reductions and combinatorial bounds for improved approximation algorithms
• The differential of the line graph \(\mathcal{L} (G)\)
• Computing the differential of a graph: hardness, approximability and exact algorithms
• Using maximality and minimality conditions to construct inequality chains
• The differential on graph operator \(\mathrm{R}(G)\)
• The differential of the strong product graphs
• Total $k$-domination in strong product graphs

This page was built for publication: Enclaveless sets and MK-Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3853669)