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 math.COShow all

6 papers · 1 filter

math.CO2023

Computing pivot-minors

Konrad K. Dabrowski, François Dross, Jisu Jeong +4

A graph $G$ contains a graph $H$ as a pivot-minor if $H$ can be obtained from $G$ by applying a sequence of vertex deletions and edge pivots. Pivot-minors play an important role in…

math.CO2020

Tree pivot-minors and linear rank-width

Konrad K. Dabrowski, François Dross, Jisu Jeong +4

Tree-width and its linear variant path-width play a central role for the graph minor relation. In particular, Robertson and Seymour (1983) proved that for every tree~ $T$ , the class…

math.CO2019

Online Ramsey theory for a triangle on $F$ -free graphs

Hojin Choi, Ilkyoo Choi, Jisu Jeong +1

Given a class $C$ of graphs and a fixed graph $H$ , the online Ramsey game for $H$ on $C$ is a game between two players Builder and Painter as follows: an unbound…

math.CO2016★ 1 cited

Characterizing graphs of maximum matching width at most 2

Jisu Jeong, Seongmin Ok, Geewon Suh

The maximum matching width is a width-parameter that is defined on a branch-decomposition over the vertex set of a graph. The size of a maximum matching in the bipartite graph is u…

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}$ …

math.CO2013★ 19 cited

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

Jisu Jeong, O-joung Kwon, Sang-il Oum

Linear rank-width is a graph width parameter, which is a variation of rank-width by restricting its tree to a caterpillar. As a corollary of known theorems, for each $k$ , there is…