1 citations · 1 across the 4 of their papers we have counts for
4 papers · 1 filter
Separating Matchings in Cubic Graphs
Juan Gutiérrez, Renzo Gómez
We study separating matchings in graphs, that is, matchings whose removal increases the number of connected components, and focus on determining the maximum size of such a matching…
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 vertices with less than edges has a vertex cut that induces a forest, and co…
Domination and packing in graphs
Renzo Gómez, Juan Gutiérrez
Given a graph~, the domination number, denoted by~, is the minimum cardinality of a dominating set in~. Dual to the notion of domination number is the packing number of…
Path eccentricity of graphs
Renzo Gómez, Juan Gutiérrez
Let be a connected graph. The eccentricity of a path , denoted by ecc, is the maximum distance from to any vertex in . In the \textsc{Central path} (CP) proble…