Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable. - Pongpat Sittitrai; Kittikorn Nakprasit (CoRR, 2018)

Defective 2-colorings of planar graphs without 4-cycles and 5-cycles. - Pongpat Sittitrai; Kittikorn Nakprasit (Discret. Math., 2018)

Sufficient Conditions on Planar Graphs to Have a Relaxed DP-3-Coloring. - Pongpat Sittitrai; Kittikorn Nakprasit (Graphs Comb., 2019)

DP-4-colorability of planar graphs without adjacent cycles of given length. - Runrun Liu; Xiangwen Li; Kittikorn Nakprasit; Pongpat Sittitrai; Gexin Yu (Discret. Appl. Math., 2020)

Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate. - Pongpat Sittitrai; Kittikorn Nakprasit (Discret. Math., 2021)

Defective DP-colorings of sparse multigraphs. - Yifan Jing; Alexandr V. Kostochka; Fuhong Ma; Pongpat Sittitrai; Jingwei Xu (Eur. J. Comb., 2021)

Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate. - Pongpat Sittitrai; Kittikorn Nakprasit (Discret. Math., 2022)

An analogue of DP-coloring for variable degeneracy and its applications. - Pongpat Sittitrai; Kittikorn Nakprasit (Discuss. Math. Graph Theory, 2022)

Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles. - Sarawute Sribunhung; Keaitsuda Nakprasit; Kittikorn Nakprasit; Pongpat Sittitrai (Discuss. Math. Graph Theory, 2023)

Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles. - Kittikorn Nakprasit; Watcharintorn Ruksasakchai; Pongpat Sittitrai (Theor. Comput. Sci., 2023)

Planar graphs without 4- and 6-cycles are (3,4)-colorable. - Kittikorn Nakprasit; Pongpat Sittitrai; Wannapol Pimpasalee (Discret. Appl. Math., 2024)

Planar Graphs without Cycles of Length 3, 4, and 6 are (3, 3)-Colorable. - Pongpat Sittitrai; Wannapol Pimpasalee (Int. J. Math. Math. Sci., 2024)

Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition. - Wipawee Tangjai; Kittikorn Nakprasit; Keaitsuda Maneeruk Nakprasit; Pongpat Sittitrai (Discret. Appl. Math., 2024)

Edge DP-coloring of planar graphs without 4-cycles and specific cycles. - Patcharapan Jumnongnit; Kittikorn Nakprasit; Watcharintorn Ruksasakchai; Pongpat Sittitrai (Discret. Math., 2025)

Sufficient Conditions make Graphs Edge DP-$ varDelta $-Colorable. - Watcharintorn Ruksasakchai; Pongpat Sittitrai (Graphs Comb., 2025)