M. C. Dourado

activity

20152025

most citedWeakly toll convexity and proper interval graphs

3 citations · 4 across the 11 of their papers we have counts for

collaborators

Showing 2022 · math.COShow all

3 papers · 2 filters

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★ 3 cited

Weakly toll convexity and proper interval graphs

Mitre C. Dourado, Marisa Gutierrez, Fábio Protti +1

A walk $u_{0} u_{1} \dots u_{k - 1} u_{k}$ is a \textit{weakly toll walk} if $u_{0} u_{i} \in E (G)$ implies $u_{i} = u_{1}$ and $u_{j} u_{k} \in E (G)$ implies $u_{j} = u_{k - 1}$ . A set $S$ of vertices of $G$ i…

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…