DP-4-colorability conjecture for planar graphs without chorded 6-cycles

Let $G$ be a planar graph, and suppose that $G$ contains no chorded $6$-cycle, meaning no cycle of length six with an edge joining two nonconsecutive vertices on the cycle. A graph is DP-$4$-colorable if every cover of $G$ admits a DP-coloring with four colors.

DP-4-colorability conjecture. Every planar graph without chorded $6$-cycles is DP-$4$-colorable.

The preceding results establish DP-$4$-colorability for a narrower class of planar graphs excluding specified configurations, but the paper does not prove the conjecture for all planar graphs without chorded $6$-cycles.