加载中…
A cover of a graph is a graph with vertex set , where , and the edge set , where is a matching between and . A vertex set is a transversal of if for each . Let be a nonnegative integer valued function on the vertex-set of . If for any nonempty subgraph of , there exists a vertex such that , then is called a strictly -degenerate transversal. In this paper, we give a sufficient condition for the existence of strictly -degenerate transversal for planar graphs without chorded -cycles. As a consequence, every planar graph without subgraphs isomorphic to the configurations in Fig. 4 is DP--colorable.

生成讲解博客的中文版本

生成AI智能校验的中文版本