Kittikorn Nakprasit

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 18

Top Topics

Sufficient Conditions

Asymptotic Stability

Top Venues

Discret. Appl. Math.

Publications

Wipawee Tangjai, Kittikorn Nakprasit, Keaitsuda Maneeruk Nakprasit, Pongpat Sittitrai
Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition. Discret. Appl. Math. 342 (2024)
Kittikorn Nakprasit, Pongpat Sittitrai, Wannapol Pimpasalee
Planar graphs without 4- and 6-cycles are (3,4)-colorable. Discret. Appl. Math. 356 (2024)
Kittikorn Nakprasit, Watcharintorn Ruksasakchai, Pongpat Sittitrai
Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles. Theor. Comput. Sci. 941 (2023)
Sarawute Sribunhung, Keaitsuda Nakprasit, Kittikorn Nakprasit, Pongpat Sittitrai
Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles. Discuss. Math. Graph Theory 43 (1) (2023)
Janejira Laomala, Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit, Watcharintorn Ruksasakchai
The Strong Equitable Vertex 1-Arboricity of Complete Bipartite Graphs and Balanced Complete k-Partite Graphs. Symmetry 14 (2) (2022)
Pongpat Sittitrai, Kittikorn Nakprasit
An analogue of DP-coloring for variable degeneracy and its applications. Discuss. Math. Graph Theory 42 (1) (2022)
Anupong Kanarach, Kittikorn Nakprasit, Banchar Arnonkijpanich
Estimating the Physical Parameters of Human Arm Motion from Video using Fixed-Point PCA Transform and Nonlinear Least-Squares Method. ICFSP (2022)
Pongpat Sittitrai, Kittikorn Nakprasit
Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate. Discret. Math. 345 (9) (2022)
Pongpat Sittitrai, Kittikorn Nakprasit
Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate. Discret. Math. 344 (11) (2021)
Runrun Liu, Xiangwen Li, Kittikorn Nakprasit, Pongpat Sittitrai, Gexin Yu
DP-4-colorability of planar graphs without adjacent cycles of given length. Discret. Appl. Math. 277 (2020)
Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit
A Generalization of Some Results on List Coloring and DP-Coloring. Graphs Comb. 36 (4) (2020)
Pongpat Sittitrai, Kittikorn Nakprasit
Sufficient Conditions on Planar Graphs to Have a Relaxed DP-3-Coloring. Graphs Comb. 35 (4) (2019)
Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit
The Game Coloring Number of Planar Graphs with a Specific Girth. Graphs Comb. 34 (2) (2018)
Pongpat Sittitrai, Kittikorn Nakprasit
Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable. CoRR (2018)
Pongpat Sittitrai, Kittikorn Nakprasit
Defective 2-colorings of planar graphs without 4-cycles and 5-cycles. Discret. Math. 341 (8) (2018)
Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit
The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs. Inf. Process. Lett. 117 (2017)
Patcharapan Jumnongnit, Kittikorn Nakprasit
Graphs with Bounded Maximum Average Degree and Their Neighbor Sum Distinguishing Total-Choice Numbers. Int. J. Math. Math. Sci. 2017 (2017)
Keaitsuda Nakprasit, Kittikorn Nakprasit
The strong chromatic index of graphs with restricted Ore-degrees. Ars Comb. 118 (2015)
Watcharintorn Ruksasakchai, Kittikorn Nakprasit
(2, t)-choosasble graphs. Ars Comb. 113 (2014)
Keaitsuda Nakprasit, Kittikorn Nakprasit
The strong chromatic index of graphs and subdivisions. Discret. Math. 317 (2014)
Watcharintorn Ruksasakchai, Kittikorn Nakprasit
On a conjecture about (k, t)-choosability. Ars Comb. 111 (2013)
Kittikorn Nakprasit
Equitable colorings of planar graphs with maximum degree at least nine. Discret. Math. 312 (5) (2012)
Keaitsuda Nakprasit, Kittikorn Nakprasit
Equitable colorings of planar graphs without short cycles. Theor. Comput. Sci. 465 (2012)
Béla Bollobás, Alexandr V. Kostochka, Kittikorn Nakprasit
Packing d-degenerate graphs. J. Comb. Theory, Ser. B 98 (1) (2008)
Kittikorn Nakprasit
A note on the strong chromatic index of bipartite graphs. Discret. Math. 308 (16) (2008)
Seog-Jin Kim, Kittikorn Nakprasit
Coloring the complements of intersection graphs of geometric figures. Discret. Math. 308 (20) (2008)
Seog-Jin Kim, Kittikorn Nakprasit, Michael J. Pelsmajer, Jozef Skokan
Transversal numbers of translates of a convex body. Discret. Math. 306 (18) (2006)
Alexandr V. Kostochka, Kittikorn Nakprasit
-coloring of graphs with low average degree. Theor. Comput. Sci. 349 (1) (2005)
Alexandr V. Kostochka, Kittikorn Nakprasit, Sriram V. Pemmaraju
On Equitable Coloring of d-Degenerate Graphs. SIAM J. Discret. Math. 19 (1) (2005)
Seog-Jin Kim, Kittikorn Nakprasit
). Graphs Comb. 20 (1) (2004)
Seog-Jin Kim, Alexandr V. Kostochka, Kittikorn Nakprasit
On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane. Electron. J. Comb. 11 (1) (2004)
Sriram V. Pemmaraju, Kittikorn Nakprasit, Alexandr V. Kostochka
Equitable colorings with constant number of colors. SODA (2003)
Alexandr V. Kostochka, Kittikorn Nakprasit
Equitable Colourings Of D-Degenerate Graphs. Comb. Probab. Comput. 12 (1) (2003)