Renzo Gómez

activity

20222026

most citedDomination and packing in graphs

1 citations · 1 across the 4 of their papers we have counts for

collaborators

Showing 2024Show all

2 papers · 1 filter

math.CO2024

Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs

F. Botler, Y. S. Couto, C. G. Fernandes +4

Chernyshev, Rauch, and Rautenbach proved that every connected graph on $n$ vertices with less than $\frac{11}{5} n - \frac{18}{5}$ edges has a vertex cut that induces a forest, and co…

math.CO2024★ 1 cited

Domination and packing in graphs

Renzo Gómez, Juan Gutiérrez

Given a graph~ $G$ , the domination number, denoted by~ $γ (G)$ , is the minimum cardinality of a dominating set in~ $G$ . Dual to the notion of domination number is the packing number of…