Abstract
AbstractIn 2018, Dvořák and Postle introduced a generalization of proper coloring, the so‐called DP‐coloring. For any graph , the DP‐chromatic number of is defined analogously with the chromatic number of . In this article, we show that holds for , where is the join of and a complete graph with vertices. As a result, holds for every integer , where is the minimum nonnegative integer such that holds for every graph with vertices. Our result improves the best current upper bound of due to Bernshteyn, Kostochka, and Zhu.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.