Pongpat Sittitrai, Kittikorn Nakprasit
Published 2018-01-21Version 1
DP-coloring is a generalization of a list coloring in a simple graph. Kim and Ozeki showed that planar graphs without $k$-cycles where $k=3,4,5,$ or $6$ are DP-$4$-colorable. In this paper, we extend the result on $3$- and $6$-cycles by showing that planar graphs without triangles adjacent to $6$-cycles are DP-$4$-colorable.
A generalization of weight polynomials to matroids
Some $q$-congruences for homogeneous and quasi-homogeneous multiple $q$-harmonic sums
A generalization of Aztec diamond theorem, part I
![QR code for arXiv:1801.06760 [math.CO]](http://oss.arxitics.com/images/favicon.svg)