Papers
Topics
Authors
Recent
Search
2000 character limit reached

Variable degeneracy of planar graphs without chorded 6-cycles

Published 25 Feb 2025 in math.CO | (2502.18089v1)

Abstract: A cover of a graph GG is a graph HH with vertex set V(H)=⋃v∈V(G)LvV(H) = \bigcup_{v \in V(G)} L_{v}, where Lv=v×[s]L_{v} = {v} \times [s], and the edge set M=⋃uv∈E(G)MuvM = \bigcup_{uv \in E(G)} M_{uv}, where MuvM_{uv} is a matching between LuL_{u} and LvL_{v}. A vertex set T⊆V(H)T \subseteq V(H) is a transversal of HH if ∣T∩Lv∣=1|T \cap L_{v}| = 1 for each v∈V(G)v \in V(G). Let ff be a nonnegative integer valued function on the vertex-set of HH. If for any nonempty subgraph Γ\Gamma of H[T]H[T], there exists a vertex x∈V(H)x \in V(H) such that $d(x) < f(x)$, then TT is called a strictly ff-degenerate transversal. In this paper, we give a sufficient condition for the existence of strictly ff-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.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.