Variable degeneracy of planar graphs without chorded 6-cycles
Huihui Fang, Danjun Huang, Tao Wang, Weifan Wang

TL;DR
This paper establishes a sufficient condition for the existence of strictly f-degenerate transversals in planar graphs without chorded 6-cycles, leading to new results on DP-4-colorability of such graphs.
Contribution
It introduces a new sufficient condition for strictly f-degenerate transversals in a specific class of planar graphs, advancing understanding of their coloring properties.
Findings
Provides a sufficient condition for strictly f-degenerate transversals in these graphs.
Shows that certain planar graphs are DP-4-colorable.
Extends coloring results to graphs excluding specific subgraph configurations.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
