Kittikorn Nakprasit

According to our database, Kittikorn Nakprasit authored at least 33 papers between 2003 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

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., January, 2024

Planar graphs without 4- and 6-cycles are (3,4)-colorable.

Kittikorn Nakprasit, Pongpat Sittitrai, Wannapol Pimpasalee

Discret. Appl. Math., 2024

2023

Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles.

Kittikorn Nakprasit, Watcharintorn Ruksasakchai, Pongpat Sittitrai

Theor. Comput. Sci., 2023

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

2022

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

An analogue of DP-coloring for variable degeneracy and its applications.

Pongpat Sittitrai, Kittikorn Nakprasit

Discuss. Math. Graph Theory, 2022

Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate.

Pongpat Sittitrai, Kittikorn Nakprasit

Discret. Math., 2022

Estimating the Physical Parameters of Human Arm Motion from Video using Fixed-Point PCA Transform and Nonlinear Least-Squares Method.

Anupong Kanarach, Kittikorn Nakprasit, Banchar Arnonkijpanich

Proceedings of the 7th International Conference on Frontiers of Signal Processing, 2022

2021

Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate.

Pongpat Sittitrai, Kittikorn Nakprasit

Discret. Math., 2021

2020

A Generalization of Some Results on List Coloring and DP-Coloring.

Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit

Graphs Comb., 2020

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

2019

Sufficient Conditions on Planar Graphs to Have a Relaxed DP-3-Coloring.

Pongpat Sittitrai, Kittikorn Nakprasit

Graphs Comb., 2019

2018

The Game Coloring Number of Planar Graphs with a Specific Girth.

Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit

Graphs Comb., 2018

Defective 2-colorings of planar graphs without 4-cycles and 5-cycles.

Pongpat Sittitrai, Kittikorn Nakprasit

Discret. Math., 2018

Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable.

Pongpat Sittitrai, Kittikorn Nakprasit

CoRR, 2018

2017

The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs.

Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit

Inf. Process. Lett., 2017

Graphs with Bounded Maximum Average Degree and Their Neighbor Sum Distinguishing Total-Choice Numbers.

Patcharapan Jumnongnit, Kittikorn Nakprasit

Int. J. Math. Math. Sci., 2017

2015

The strong chromatic index of graphs with restricted Ore-degrees.

Keaitsuda Nakprasit, Kittikorn Nakprasit

Ars Comb., 2015

2014

The strong chromatic index of graphs and subdivisions.

Keaitsuda Nakprasit, Kittikorn Nakprasit

Discret. Math., 2014

(2, t)-choosasble graphs.

Watcharintorn Ruksasakchai, Kittikorn Nakprasit

Ars Comb., 2014

2013

On a conjecture about (k, t)-choosability.

Watcharintorn Ruksasakchai, Kittikorn Nakprasit

Ars Comb., 2013

2012

Equitable colorings of planar graphs without short cycles.

Keaitsuda Nakprasit, Kittikorn Nakprasit

Theor. Comput. Sci., 2012

Equitable colorings of planar graphs with maximum degree at least nine.

Kittikorn Nakprasit

Discret. Math., 2012

2008

Packing d-degenerate graphs.

Béla Bollobás, Alexandr V. Kostochka, Kittikorn Nakprasit

J. Comb. Theory B, 2008

A note on the strong chromatic index of bipartite graphs.

Kittikorn Nakprasit

Discret. Math., 2008

Coloring the complements of intersection graphs of geometric figures.

Seog-Jin Kim, Kittikorn Nakprasit

Discret. Math., 2008

2006

Transversal numbers of translates of a convex body.

Seog-Jin Kim, Kittikorn Nakprasit, Michael J. Pelsmajer, Jozef Skokan

Discret. Math., 2006

2005

On equitable <i>Delta</i>-coloring of graphs with low average degree.

Alexandr V. Kostochka, Kittikorn Nakprasit

Theor. Comput. Sci., 2005

On Equitable Coloring of d-Degenerate Graphs.

Alexandr V. Kostochka, Kittikorn Nakprasit, Sriram V. Pemmaraju

SIAM J. Discret. Math., 2005

2004

On the Chromatic Number of the Square of the Kneser Graph <i>K</i>(2 <i>k</i>+1, <i>k</i>).

Seog-Jin Kim, Kittikorn Nakprasit

Graphs Comb., 2004

On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane.

Seog-Jin Kim, Alexandr V. Kostochka, Kittikorn Nakprasit

Electron. J. Comb., 2004

2003

Equitable Colourings Of D-Degenerate Graphs.

Alexandr V. Kostochka, Kittikorn Nakprasit

Comb. Probab. Comput., 2003

Equitable colorings with constant number of colors.

Sriram V. Pemmaraju, Kittikorn Nakprasit, Alexandr V. Kostochka

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003