17 citations · 116 across the 43 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2020★ 5 cited
Flexibility of Planar Graphs -- Sharpening the Tools to Get Lists of Size Four
Ilkyoo Choi, Felix Christian Clemen, Michael Ferrara +3
A graph where each vertex has a list of available colors is -colorable if there is a proper coloring such that the color of is in for each . A graph is…
cs.DM2019
Partitioning sparse graphs into an independent set and a graph with bounded size components
Ilkyoo Choi, François Dross, Pascal Ochem
We study the problem of partitioning the vertex set of a given graph so that each part induces a graph with components of bounded order; we are also interested in restricting these…