5 citations · 9 across the 16 of their papers we have counts for
5 papers · 1 filter
Expanded-clique graphs and the domination problem
Mitre C. Dourado, Rodolfo A. Oliveira, Vitor Ponciano +2
Given a graph such that each vertex has a value , the expanded-clique graph is the graph where each vertex of becomes a clique of size $f(v_i)…
On restricted completions of chordal and trivially perfect graphs
Mitre C. Dourado, Luciano N. Grippo, Mario Valencia-Pabon
Let be a graph having a vertex such that is a trivially perfect graph. We give a polynomial-time algorithm for the problem of deciding whether it is possible to…
Weakly toll convexity and proper interval graphs
Mitre C. Dourado, Marisa Gutierrez, Fábio Protti +1
A walk is a \textit{weakly toll walk} if implies and implies . A set of vertices of i…
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…
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 -intersecting if every nonempty subfamily of or fewer sets has at least elements in its total intersection. A family of sets has the -Hell…