306 citations
- Institute for Basic ScienceKR20 papers
- Seoul National UniversityKR19 papers
- Korea Advanced Institute of Science and TechnologyKR12 papers
- University of UlsanKR10 papers
- Ulsan National Institute of Science and TechnologyKR9 papers
- Hanyang UniversityKR5 papers
- Lawrence Berkeley National LaboratoryUS4 papers
- National Institute for Mathematical SciencesKR4 papers
- National University CollegePR4 papers
- Pohang University of Science and TechnologyKR4 papers
- Yonsei UniversityKR4 papers
- Brookhaven National LaboratoryUS3 papers
4 papers · 2 filters
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…
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 .
Graphs of bounded depth- rank-brittleness
O-joung Kwon, Sang-il Oum
We characterize classes of graphs closed under taking vertex-minors and having no and no disjoint union of copies of the -subdivision of for some . Our ch…
Branch-depth: Generalizing tree-depth of graphs
Matt DeVos, O-joung Kwon, Sang-il Oum
We present a concept called the branch-depth of a connectivity function, that generalizes the tree-depth of graphs. Then we prove two theorems showing that this concept aligns clos…