Variable degeneracy of planar graphs without chorded 6-cycles
Abstract
A cover of a graph G is a graph H with vertex set V(H) = v ∈ V(G) Lv, where Lv = \v\ × [s], and the edge set M = uv ∈ E(G) Muv, where Muv is a matching between Lu and Lv. A vertex set T ⊂eq V(H) is a transversal of H if |T Lv| = 1 for each v ∈ V(G). Let f be a nonnegative integer valued function on the vertex-set of H. If for any nonempty subgraph of H[T], there exists a vertex x ∈ V(H) such that d(x) < f(x), then T is called a strictly f-degenerate transversal. In this paper, we give a sufficient condition for the existence of strictly f-degenerate transversal for planar graphs without chorded 6-cycles. As a consequence, every planar graph without subgraphs isomorphic to the configurations in Fig. 4 is DP-4-colorable.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.