14 citations · 19 across the 3 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2026
Steiner Forest for -Subgraph-Free Graphs
Tala Eagling-Vose, David C. Kutner, Felicia Lucke +4
Our main result is a full classification, for every connected graph , of the computational complexity of Steiner Forest on -subgraph-free graphs. To obtain this dichotomy, we…
math.CO2023
Computing Subset Vertex Covers in -Free Graphs
Nick Brettell, Jelle J. Oostveen, Sukanya Pandey +3
We consider a natural generalization of Vertex Cover: the Subset Vertex Cover problem, which is to decide for a graph , a subset and integer , if has…
math.CO2020
Upper Bounding Rainbow Connection Number by Forest Number
L. Sunil Chandran, Davis Issac, Juho Lauri +1
A path in an edge-colored graph is rainbow if no two edges of it are colored the same, and the graph is rainbow-connected if there is a rainbow path between each pair of its vertic…