Martín D. Safe

activity

20142023

most citedForbidden Induced Subgraphs of Normal Helly Circular-Arc Graphs: Characterization and Detection

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

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2023

Nonexistence of uniformly most reliable graphs of least corank

Pablo Romero, Martín D. Safe

If $G$ is a simple graph and $ρ \in [0, 1]$ , the reliability $R_{G} (ρ)$ is the probability of $G$ being connected after each of its edges is removed independently with probability $ρ$ .…

math.CO2016

Characterization and linear-time detection of minimal obstructions to concave-round graphs and the circular-ones property

Martín D. Safe

A graph is concave-round if its vertices can be circularly enumerated so that the closed neighbourhood of each vertex is an interval in the enumeration. In this work, we give a min…