8 citations · 15 across the 6 of their papers we have counts for
5 papers · 1 filter
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 $\…
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…
List-3-Coloring ordered graphs with a forbidden induced subgraph
Sepehr Hajebi, Yanjia Li, Sophie Spirkl
The List-3-Coloring Problem is to decide, given a graph and a list of colors assigned to each vertex of , whether admits a proper coloring…
The -coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size
Yanjia Li, Sophie Spirkl
Motivated by the analogous questions in graphs, we study the complexity of coloring and stable set problems in hypergraphs with forbidden substructures and bounded edge size. Letti…
Complexity dichotomy for List-5-Coloring with a forbidden induced subgraph
Sepehr Hajebi, Yanjia Li, Sophie Spirkl
For a positive integer and graphs and , we denote by the disjoint union of and , and by the union of mutually disjoint copies of . Also, we say…