20 citations · 180 across the 43 of their papers we have counts for
4 papers · 1 filter
Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors
Ilkyoo Choi, O-joung Kwon, Sang-il Oum
A fan is a graph that consists of an induced path on vertices and an additional vertex that is adjacent to all vertices of the path. We prove that for all positive intege…
Linear rank-width of distance-hereditary graphs II. Vertex-minor obstructions
Mamadou Moustapha Kanté, O-joung Kwon
In the companion paper [Linear rank-width of distance-hereditary graphs I. A polynomial-time algorithm, Algorithmica 78(1):342--377, 2017], we presented a characterization of the l…
A polynomial kernel for Block Graph Deletion
Eun Jung Kim, O-joung Kwon
In the Block Graph Deletion problem, we are given a graph on vertices and a positive integer , and the objective is to check whether it is possible to delete at most …
An FPT algorithm and a polynomial kernel for Linear Rankwidth-1 Vertex Deletion
Mamadou Moustapha Kanté, Eun Jung Kim, O-joung Kwon +1
Linear rankwidth is a linearized variant of rankwidth, introduced by Oum and Seymour [Approximating clique-width and branch-width. J. Combin. Theory Ser. B, 96(4):514--528, 2006].…