8 citations · 50 across the 23 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017★ 6 cited
Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
Seog-Jin Kim, Xiaowei Yu
DP-coloring (also known as correspondence coloring) of a simple graph is a generalization of list coloring. It is known that planar graphs without 4-cycles adjacent to triangles ar…
math.CO2017★ 5 cited
A Sufficient condition for DP-4-colorability
Seog-Jin Kim, Kenta Ozeki
DP-coloring of a simple graph is a generalization of list coloring, and also a generalization of signed coloring of signed graphs. It is known that for each ,…
math.CO2017★ 3 cited
A note on a Brooks' type theorem for DP-coloring
Seog-Jin Kim, Kenta Ozeki
Dvořák and Postle \cite{DP} introduced a \textit{DP-coloring} of a simple graph as a generalization of a list-coloring. They proved a Brooks' type theorem for a DP-coloring, and Be…