Weak degeneracy of planar graphs without 4- and 6-cycles

Abstract

A graph is $k$-degenerate if every subgraph $H$ has a vertex $v$ with $d_H(v)\le k$. The class of degenerate graphs plays an important role in the graph coloring theory. Observed that every $k$-degenerate graph is $(k+1)$-choosable and $(k+1)$-DP-colorable. Bernshteyn and Lee defined a generalization of $k$-degenerate graphs, which is called \emph{weakly $k$-degenerate}. The weak degeneracy plus one is an upper bound for many graph coloring parameters, such as choice number, DP-chromatic number and DP-paint number. In this paper, we give two sufficient conditions for a plane graph without $4$- and $6$-cycles to be weakly $2$-degenerate, which implies that every such graph is $3$-DP-colorable and near-bipartite, where a graph is near-bipartite if its vertex set can be partitioned into an independent set and an acyclic set.

13 pages

Cited by in corpus (3)

• Toroidal graphs without $K_5^{-}$ and 6-cycles
• Planar graphs without 4-, 7-, 9-cycles and 5-cycles normally adjacent to 3-cycles
• Planar graphs with distance of 3-cycles at least 2 and no cycles of lengths 5, 6, 7