Induced subsets - MaRDI portal

Cited in

(53)

Locally identifying coloring in bounded expansion classes of graphs
Partially polynomial kernels for set cover and test cover
On open-separating dominating codes in graphs
Inclusionwise minimal completely separating systems
Parameterizations of test cover with bounded test sizes
Density and dimension
Witness Sets
Disjointly representing set systems
Bounding the order of a graph using its diameter and metric dimension: a study through tree decompositions and VC dimension
Shattered matchings in intersecting hypergraphs
Revisiting and improving upper bounds for identifying codes
Open-separating dominating codes in graphs
Another algebraic proof of Bondy's theorem on induced subsets
Locating-dominating sets and identifying codes in graphs of girth at least 5
On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs
Bounds and extremal graphs for total dominating identifying codes
Set graphs. II. Complexity of set graph recognition and similar problems
On extremal problems concerning the traces of sets
The \textsc{Red-Blue Separation} problem on graphs
Progress towards the two-thirds conjecture on locating-total dominating sets
Separation with restricted families of sets
Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
Identifying path covers in graphs
Traces of hypergraphs
A generalization of Sauer's lemma
Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets
``Dart calculus of induced subsets
Characterizing extremal graphs for open neighbourhood location-domination
Edge Multiplicity and Other Trace Functions
Separating families of convex sets
Rounds in combinatorial search
Shatter functions with polynomial growth rates
The \textsc{red-blue separation} problem on graphs
On the trace of finite sets
Extremal Digraphs for open neighbourhood location-domination and identifying codes
Defect Sauer results
Separation and Witnesses
Domination and location in twin-free digraphs
Arrow relations on families of finite sets
Some best possible bounds concerning the traces of finite sets
Identifying codes in graphs of given maximum degree: characterizing trees
On the \textsc{Distance Identifying Set} meta-problem and applications to the complexity of identifying problems on graphs
Witnessing differences without redundancies
Tight (double) exponential bounds for identification problems: locating-dominating set and test cover
Identifying codes in triangle-free graphs of bounded maximum degree
Structural parameterization of locating-dominating set and test cover
On minimum saturated matrices
Extremal graphs for the identifying code problem
Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds.
Very large cliques are easy to detect
Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity
Fixed-parameter tractable algorithms for tracking shortest paths
Two proofs of Bondy's theorem on induced subsets and two related questions

This page was built for publication: Induced subsets

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