D. Kang

activity

20142023

most citedA relative of Hadwiger's conjecture

34 citations · 63 across the 15 of their papers we have counts for

collaborators

Showing 2016Show all

3 papers · 1 filter

math.CO2016★ 10 cited

Improper coloring of graphs with no odd clique minor

Dong Yeap Kang, Sang-il Oum

As a strengthening of Hadwiger's conjecture, Gerards and Seymour conjectured that every graph with no odd $K_{t}$ minor is $(t - 1)$ -colorable. We prove two weaker variants of this con…

cs.DS2016

A width parameter useful for chordal and co-comparability graphs

Dong Yeap Kang, O-joung Kwon, Torstein J. F. Strømme +1

We investigate new graph classes of bounded mim-width, strictly extending interval graphs and permutation graphs. The graphs $K_{t} ⊟ K_{t}$ and $K_{t} ⊟ S_{t}$ are graphs…

math.CO2016★ 3 cited

Sparse spanning $k$ -connected subgraphs in tournaments

Dong Yeap Kang, Jaehoon Kim, Younjin Kim +1

In 2009, Bang-Jensen asked whether there exists a function $g (k)$ such that every strongly $k$ -connected $n$ -vertex tournament contains a strongly $k$ -connected spanning subgraph w…

Improper coloring of graphs with no odd clique minor

A width parameter useful for chordal and co-comparability graphs

Sparse spanning k-connected subgraphs in tournaments

Sparse spanning $k$ -connected subgraphs in tournaments