M. C. Dourado

activity

20152025

collaborators

Showing math.COShow all

5 papers · 1 filter

math.CO2025

Partitions and covers in $Δ$ convexity

Bijo S. Anand, Manoj Changat, Mitre C. Dourado +2

Given a graph $G$ and a set $S \subseteq V (G)$ , we say that $S$ is $Δ$ -convex if the neighborhood of every vertex not in $S$ is an independent set. A collection ${\cal V} = (V_1, V…

math.CO2022

On restricted completions of chordal and trivially perfect graphs

Mitre C. Dourado, Luciano N. Grippo, Mario Valencia-Pabon

Let $G$ be a graph having a vertex $v$ such that $H = G - v$ is a trivially perfect graph. We give a polynomial-time algorithm for the problem of deciding whether it is possible to…

math.CO2022

On the generalized Helly property of hypergraphs, cliques, and bicliques

Mitre C. Dourado, Luciano N. Grippo, Martín D. Safe

A family of sets is $(p, q)$ -intersecting if every nonempty subfamily of $p$ or fewer sets has at least $q$ elements in its total intersection. A family of sets has the $(p, q)$ -Hell…

math.CO2018

Global Defensive Alliances in the Lexicographic Product of Paths and Cycles

Rommel M. Barbosa, Mitre C. Dourado, Leila R. S. da Silva

A set $S$ of vertices of graph $G$ is a \textit{defensive alliance} of $G$ if for every $v \in S$ , it holds $∣ N [v] \cap S ∣ \geq ∣ N [v] - S ∣$ . An alliance $S$ is called $g l o ba l$ if it…

math.CO2018

Partial immunization of trees

Mitre C. Dourado, Stefan Ehard, Lucia D. Penso +1

For a graph $G$ and an integer-valued function $τ$ on its vertex set, a dynamic monopoly is a set of vertices of $G$ such that iteratively adding to it vertices $u$ of $G$ that hav…