Seog-Jin Kim

activity

20092026

most citedThe competition number of a graph with exactly two holes

8 citations · 50 across the 23 of their papers we have counts for

collaborators

Showing 2019Show all

5 papers · 1 filter

math.CO2019

The Alon-Tarsi number of $K_{5}$ -minor-free graphs

Toshiki Abe, Seog-Jin Kim, Kenta Ozeki

In this paper, we show the following three theorems. Let $G$ be a $K_{5}$ -minor-free graph. Then Alon-Tarsi number of $G$ is at most $5$ , there exists a matching $M$ of $G$ such that…

math.CO2019

On list 3-dynamic coloring of near-triangulations

Ruijuan Gu, Seog-Jin Kim, Yulai Ma +1

An $r$ -dynamic $k$ -coloring of a graph $G$ is a proper $k$ -coloring such that for any vertex $v$ , there are at least $min {r, d e g_{G} (v)}$ distinct colors in $N_{G} (v)$ . The $r$ -dyn…

math.CO2019

Planar graphs without 7-cycles and butterflies are DP-4-colorable

Seog-Jin Kim, Runrun Liu, Gexin Yu

DP-coloring (also known as correspondence coloring) is a generalization of list coloring, introduced by Dvořák and Postle in 2017. It is well-known that there are non-4-choosable p…

math.CO2019★ 5 cited

The Alon-Tarsi number of subgraphs of a planar graph

Ringi Kim, Seog-Jin Kim, Xuding Zhu

This paper constructs a planar graph $G_{1}$ such that for any subgraph $H$ of $G_{1}$ with maximum degree $Δ (H) \leq 3$ , $G_{1} - E (H)$ is not $3$ -choosable, and a planar graph $G_{2}$ such…

math.CO2019

Coloring squares of graphs with mad constraints

Hervé Hocquard, Seog-Jin Kim, Théo Pierron

A proper vertex $k$ -coloring of a graph $G = (V, E)$ is an assignment $c : V \to {1, 2, \dots, k}$ of colors to the vertices of the graph such that no two adjacent vertices are associate…

The Alon-Tarsi number of K5​-minor-free graphs

On list 3-dynamic coloring of near-triangulations

Planar graphs without 7-cycles and butterflies are DP-4-colorable

The Alon-Tarsi number of subgraphs of a planar graph

Coloring squares of graphs with mad constraints

The Alon-Tarsi number of $K_{5}$ -minor-free graphs