8 citations · 15 across the 6 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
math.CO2023
Linkages and removable paths avoiding vertices
Xiying Du, Yanjia Li, Shijie Xie +1
We say that a graph is -linked if, for any distinct vertices in , there exist vertex disjoint connected subgraphs of such that $\…
math.CO2023★ 2 cited
Hitting all maximum stable sets in -free graphs
Sepehr Hajebi, Yanjia Li, Sophie Spirkl
We prove that every -free graph of bounded clique number contains a small hitting set of all its maximum stable sets. More generally, let us say a class of graph…