Variable degeneracy of planar graphs without chorded 6-cycles
Combinatorics
2025-02-26 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2502.18089,
title = {Variable degeneracy of planar graphs without chorded 6-cycles},
author = {Huihui Fang and Danjun Huang and Tao Wang and Weifan Wang},
journal= {arXiv preprint arXiv:2502.18089},
year = {2025}
}
Comments
16 pages, 13 figures