M. Gutierrez

activity

20112023

most citedOn the bend number of circular-arc graphs as edge intersection graphs of paths on a grid

13 citations · 25 across the 12 of their papers we have counts for

collaborators

15 papers

math.CO2023

Computing the hull and interval numbers in the weakly toll convexity

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

A walk $u_{0} u_{1} \dots u_{k - 1} u_{k}$ of a graph $G$ is a \textit{weakly toll walk} if $u_{0} u_{k} \neq \in E (G)$ , $u_{0} u_{i} \in E (G)$ implies $u_{i} = u_{1}$ , and $u_{j} u_{k} \in E (G)$ implies $u_j=u…

cs.DM2022

On dually-CPT and strong-CPT posets

Liliana Alcón, Martin Charles Golumbic, Noemí Gudiño +2

A poset is a containment of paths in a tree (CPT) if it admits a representation by containment where each element of the poset is represented by a path in a tree and two elements a…

math.CO2022

Convex geometries over induced paths with bounded length

Marisa Gutierrez, Fábio Protti, Silvia B. Tondato

Graph convexity spaces have been studied in many contexts. In particular, some studies are devoted to determine if a graph equipped with a convexity space is a {\em convex geometry…

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…

cs.DM2022★ 1 cited

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…

math.CO2019★ 5 cited

The Neighbor-Locating-Chromatic Number of Pseudotrees

Liliana Alcon, Marisa Gutierrez, Carmen Hernando +2

A $k$ -coloring of a graph $G$ is a partition of the set of vertices of $G$ into $k$ independent sets, which are called colors. A $k$ -coloring is neighbor-locating if any two vertic…