Jisu Jeong

activity

20132023

most citedExcluded vertex-minors for graphs of linear rank-width at most k

19 citations · 50 across the 10 of their papers we have counts for

collaborators

Showing 2014Show all

1 paper · 1 filter

math.CO2014★ 2 cited

$(1, k)$ -coloring of graphs with girth at least $5$ on a surface

Hojin Choi, Ilkyoo Choi, Jisu Jeong +1

A graph is $(d_{1}, ..., d_{r})$ -colorable if its vertex set can be partitioned into $r$ sets $V_{1}, ..., V_{r}$ so that the maximum degree of the graph induced by $V_{i}$ is at most $d_{i}$ …

(1,k)-coloring of graphs with girth at least 5 on a surface

$(1, k)$ -coloring of graphs with girth at least $5$ on a surface