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 2016Show all

2 papers · 1 filter

cs.DM2016★ 1 cited

Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs

Robert Brignall, Hojin Choi, Jisu Jeong +1

A homogeneous set of a graph $G$ is a set $X$ of vertices such that $2 \leq ∣ X ∣ < ∣ V (G)∣$ and no vertex in $V (G) - X$ has both a neighbor and a non-neighbor in $X$ …

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…