O-joung Kwon

activity

20242026

most citedTreewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star

2 citations · 2 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2025

Unavoidable butterfly minors in digraphs of large cycle rank

Meike Hatzel, O-joung Kwon, Myounghwan Lee +1

Cycle rank is one of the depth parameters for digraphs introduced by Eggan in 1963. We show that there exists a function $f : N \to N$ such that every digraph of cyc…

math.CO2024★ 2 cited

Treewidth versus clique number. IV. Tree-independence number of graphs excluding an induced star

Clément Dallard, Matjaž Krnc, O-joung Kwon +4

Many recent works address the question of characterizing induced obstructions to bounded treewidth. In 2022, Lozin and Razgon completely answered this question for graph classes de…