2 citations · 2 across the 1 of their papers we have counts for
8 papers
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…
The average cut-rank of graphs
Huy-Tung Nguyen, Sang-il Oum
The cut-rank of a set of vertices in a graph is defined as the rank of the matrix over the binary field whose -entry is if the vert…
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…
Obstructions for partitioning into forests and outerplanar graphs
Ringi Kim, Sergey Norin, Sang-il Oum
For a class of graphs, we define -edge-brittleness of a graph as the minimum such that the vertex set of can be partitioned into sets induci…
Online Ramsey theory for a triangle on -free graphs
Hojin Choi, Ilkyoo Choi, Jisu Jeong +1
Given a class of graphs and a fixed graph , the online Ramsey game for on is a game between two players Builder and Painter as follows: an unbound…
Classes of graphs with no long cycle as a vertex-minor are polynomially -bounded
Ringi Kim, O-joung Kwon, Sang-il Oum +1
A class of graphs is -bounded if there is a function such that for every graph and every induced subgraph of , . In ad…