5 citations · 12 across the 15 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
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…
math.CO2017
Sufficient conditions for the existence of a path-factor which are related to odd components
Yoshimi Egawa, Michitaka Furuya, Kenta Ozeki
In this paper, we are concerned with sufficient conditions for the existence of a -factor. We prove that for , there exists such th…