Seog-jin Kim

collaborators

4 papers

math.CO2026

The Alon-Tarsi Number of Squares of Subcubic Planar Graphs without Cycles of Lengths $4$ to $8$

Seog-Jin Kim, Xiaopan Lian, Rong Luo

The Alon--Tarsi number $A T (G)$ of a graph $G$ , defined via the graph polynomial, is a strengthening of the list chromatic number $I ¨ _{ℓ} (G)$ . We study the Alon--Tarsi number of…

math.CO2025

The square of a subcubic planar graph without a 5-cycle is 7-choosable

Seog-Jin Kim, Xiaopan Lian, Atsuhiro Nakamoto +1

The square of a graph $G$ , denoted $G^{2}$ , has the same vertex set as $G$ and has an edge between two vertices if the distance between them in $G$ is at most $2$ . Thomassen [12] sho…

math.CO2025

Squares of subcubic planar graphs without cycles of length 4-8 are 6-choosable

Seog-Jin Kim, Rong Luo

The {\em square} of a graph $G$ , denoted $G^{2}$ , has the same vertex set as $G$ and an edge between any two vertices at distance at most $2$ in $G$ . Wegner (1977) conjectured that f…

math.CO2025

The square of every subcubic planar graph without 4-cycles and 5-cycles is 7-choosable

Ligang Jin, Yingli Kang, Seog-Jin Kim

The square of a graph $G$ , denoted by $G^{2}$ , has the same vertex set as $G$ and has an edge between two vertices if the distance between them in $G$ is at most $2$ . Thomassen (2018…

The Alon-Tarsi Number of Squares of Subcubic Planar Graphs without Cycles of Lengths 4 to 8

The square of a subcubic planar graph without a 5-cycle is 7-choosable

Squares of subcubic planar graphs without cycles of length 4-8 are 6-choosable

The square of every subcubic planar graph without 4-cycles and 5-cycles is 7-choosable

The Alon-Tarsi Number of Squares of Subcubic Planar Graphs without Cycles of Lengths $4$ to $8$