30 citations · 74 across the 13 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.CO2019★ 12 cited
Obstructions for bounded shrub-depth and rank-depth
O-joung Kwon, Rose McCarty, Sang-il Oum +1
Shrub-depth and rank-depth are dense analogues of the tree-depth of a graph. It is well known that a graph has large tree-depth if and only if it has a long path as a subgraph. We…
math.CO2019★ 20 cited
The grid theorem for vertex-minors
Jim Geelen, O-Joung Kwon, Rose McCarty +1
We prove that, for each circle graph , every graph with sufficiently large rank-width contains a vertex-minor isomorphic to .
math.CO2019★ 30 cited
Circle graphs are quadratically -bounded
James Davies, Rose McCarty
We prove that the chromatic number of a circle graph with clique number is at most .