List backbone coloring of paths and cycles. - Wannapol Pimpasalee; Keaitsuda Maneeruk Nakprasit (Australas. J Comb., 2016)

On list backbone coloring of graphs. - Wannapol Pimpasalee; Keaitsuda Maneeruk Nakprasit (Ars Comb., 2018)

Planar graphs without specific cycles are 2-degenerate. - Patcharapan Jumnongnit; Wannapol Pimpasalee (Discret. Math., 2021)

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)