Equitable colorings of planar graphs without short cycles. - Keaitsuda Nakprasit; Kittikorn Nakprasit (Theor. Comput. Sci., 2012)

The strong chromatic index of graphs and subdivisions. - Keaitsuda Nakprasit; Kittikorn Nakprasit (Discret. Math., 2014)

The strong chromatic index of graphs with restricted Ore-degrees. - Keaitsuda Nakprasit; Kittikorn Nakprasit (Ars Comb., 2015)

Analytic Solutions of a Second-Order Functional Differential Equation with a State Derivative Dependent Delay. - Jiraphorn Somsuwan; Keaitsuda Maneeruk Nakprasit (Int. J. Math. Math. Sci., 2015)

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

The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs. - Keaitsuda Maneeruk Nakprasit; Kittikorn Nakprasit (Inf. Process. Lett., 2017)

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

The Game Coloring Number of Planar Graphs with a Specific Girth. - Keaitsuda Maneeruk Nakprasit; Kittikorn Nakprasit (Graphs Comb., 2018)

Some Bounds for the Polar Derivative of a Polynomial. - Jiraphorn Somsuwan; Keaitsuda Maneeruk Nakprasit (Int. J. Math. Math. Sci., 2018)

A Generalization of Some Results on List Coloring and DP-Coloring. - Keaitsuda Maneeruk Nakprasit; Kittikorn Nakprasit (Graphs Comb., 2020)

Inequalities for the Derivative of Rational Functions with Prescribed Poles. - Nuttapong Arunrat; Keaitsuda Maneeruk Nakprasit (Int. J. Math. Math. Sci., 2020)

On Fejér Type Inequalities via (p, q)-Calculus. - Nuttapong Arunrat; Keaitsuda Maneeruk Nakprasit; Kamsing Nonlaopon; Jessada Tariboon; Sotiris K. Ntouyas (Symmetry, 2021)

The Strong Equitable Vertex 1-Arboricity of Complete Bipartite Graphs and Balanced Complete k-Partite Graphs. - Janejira Laomala; Keaitsuda Maneeruk Nakprasit; Kittikorn Nakprasit; Watcharintorn Ruksasakchai (Symmetry, 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)

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)