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

Showing math.COShow all

13 papers · 1 filter

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…

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…

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…

math.CO2019

$t$ -Pebbling in $k$ -connected diameter two graphs

Liliana Alcón, Marisa Gutierrez, Glenn Hurlbert

Graph pebbling models the transportation of consumable resources. As two pebbles move across an edge, one reaches its destination while the other is consumed. The $t$ -pebbling numb…

math.CO2018

A characterization of claw-free CIS graphs and new results on the order of CIS graphs

Liliana Alcón, Marisa Gutierrez, Martin Milanič

A graph is CIS if every maximal clique interesects every maximal stable set. Currently, no good characterization or recognition algorithm for the CIS graphs is known. We characteri…