31 citations · 126 across the 26 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
math.CO2018★ 1 cited
Local Coloring and its Complexity
Jie You, Yixin Cao, Jianxin Wang
A -coloring of a graph is an assignment of integers between and to vertices in the graph such that the endpoints of each edge receive different numbers. We study a local…
cs.DS2018★ 1 cited
A -vertex Kernel for -packing
Wenjun Li, Junjie Ye, Yixin Cao
The -packing problem asks for whether a graph contains vertex-disjoint paths each of length two. We continue the study of its kernelization algorithms, and develop a -…
cs.DS2018
A Polynomial Kernel for Diamond-Free Editing
Yixin Cao, Ashutosh Rai, R. B. Sandeep +1
An -free editing problem asks whether we can edit at most edges to make a graph contain no induced copy of the fixed graph . We obtain a polynomial kernel for this proble…