6 citations · 7 across the 8 of their papers we have counts for
Showing 2016 · math.COShow all
3 papers · 2 filters
math.CO2016
On DP-coloring of graphs and multigraphs
Anton Bernshteyn, Alexandr Kostochka, Sergei Pron
While solving a question on list coloring of planar graphs, Dvořák and Postle introduced the new notion of DP-coloring (they called it correspondence coloring). A DP-coloring of a…
math.CO2016
Sharp Dirac's Theorem for DP-Critical Graphs
Anton Bernshteyn, Alexandr Kostochka
Correspondence coloring, or DP-coloring, is a generalization of list coloring introduced recently by Dvořák and Postle. In this paper we establish a version of Dirac's theorem on t…
math.CO2016
Regular colorings and factors of regular graphs
Anton Bernshteyn, Omid Khormali, Ryan R. Martin +4
An -coloring of an -regular graph is an edge coloring such that each vertex is incident to edges of one color and edge of a different color. In this paper…