English

Variable degeneracy of planar graphs without chorded 6-cycles

Combinatorics 2025-02-26 v1

Abstract

A cover of a graph GG is a graph HH with vertex set V(H)=vV(G)LvV(H) = \bigcup_{v \in V(G)} L_{v}, where Lv={v}×[s]L_{v} = \{v\} \times [s], and the edge set M=uvE(G)MuvM = \bigcup_{uv \in E(G)} M_{uv}, where MuvM_{uv} is a matching between LuL_{u} and LvL_{v}. A vertex set TV(H)T \subseteq V(H) is a transversal of HH if TLv=1|T \cap L_{v}| = 1 for each vV(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 xV(H)x \in V(H) such that d(x)<f(x)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 66-cycles. As a consequence, every planar graph without subgraphs isomorphic to the configurations in Fig. 4 is DP-44-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

R2 v1 2026-06-28T21:57:09.495Z