B. Martínez-Barona

most citedSufficient conditions for a digraph to admit a

(1, \leq ℓ)

-identifying code

1 citations · 1 across the 2 of their papers we have counts for

collaborators

3 papers

math.CO2020

Strong cliques in diamond-free graphs

Nina Chiarelli, Berenice Martínez Barona, Martin Milanič +2

A strong clique in a graph is a clique intersecting all inclusion-maximal stable sets. Strong cliques play an important role in the study of perfect graphs. We study strong cliques…

math.CO2019

Identifying codes in line digraphs

C. Balbuena, C. Dalfó, B. Martínez-Barona

Given an integer $ℓ \geq 1$ , a $(1, \leq ℓ)$ -identifying code in a digraph is a dominating subset $C$ of vertices such that all distinct subsets of vertices of cardinality at mos…

math.CO2019★ 1 cited

Sufficient conditions for a digraph to admit a $(1, \leq ℓ)$ -identifying code

C. Balbuena, C. Dalfó, B. Martínez-Barona

A $(1, \leq ℓ)$ -identifying code in a digraph $D$ is a subset $C$ of vertices of $D$ such that all distinct subsets of vertices of cardinality at most $ℓ$ have different closed…

Strong cliques in diamond-free graphs

Identifying codes in line digraphs

Sufficient conditions for a digraph to admit a (1,≤ℓ)-identifying code

Sufficient conditions for a digraph to admit a $(1, \leq ℓ)$ -identifying code