DP-临界图的夏普狄拉克定理
Sharp Dirac's Theorem for DP-Critical Graphs
摘要:
对应着色(英语:Correspondence coloring),简称DP-着色,是最近由Dvoconák和Postle提出的列表着色的推广。本文在DP-染色的框架下建立了关于临界图最少边数的Dirac定理的一个版本。我们的主要结果的推论回答了一个问题所提出的Kostochka和Stiebitz分类列表-临界图,满足狄拉克的界限与平等。
英文摘要:
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 the minimum number of edges in critical graphs in the framework of DP-colorings. A corollary of our main result answers a question posed by Kostochka and Stiebitz on classifying list-critical graphs that satisfy Dirac's bound with equality.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。