M. C. Dourado

collaborators

4 papers

math.CO2026

Partitions and covers in $I^$ 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 $I^$ -convex if the neighborhood of every vertex not in $S$ is an independent set. A collection ${\cal V} = (V_1,…

cs.DM2024

Characterizations of graph classes via convex geometries: a survey

Mitre C. Dourado, Marisa Gutierrez, FÃ¡bio Protti +2

Graph convexity has been used as an important tool to better understand the structure of classes of graphs. Many studies are devoted to determine if a graph equipped with a convexi…

cs.DM2024

Expanded-clique graphs and the domination problem

Mitre C. Dourado, Rodolfo A. Oliveira, Vitor Ponciano +2

Given a graph $G$ such that each vertex $v_{i}$ has a value $f (v_{i})$ , the expanded-clique graph $H$ is the graph where each vertex $v_{i}$ of $G$ becomes a clique $V_{i}$ of size $f(v_i)…

math.CO2024

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…

Partitions and covers in I^ convexity

Characterizations of graph classes via convex geometries: a survey

Expanded-clique graphs and the domination problem

Weakly toll convexity and proper interval graphs

Partitions and covers in $I^$ convexity