2 papers
cs.DS2026
Hardness of Dynamic Core and Truss Decompositions
Yan S. Couto, Cristina G. Fernandes
The k-core of a graph is its maximal subgraph with minimum degree at least k, and the core value of a vertex u is the largest k for which u is contained in the k-core of the graph.…
math.CO2025
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…