Kittikorn Nakprasit

37 papers A* 1Journal 35Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Edge DP-coloring of planar graphs without 4-cycles and specific cycles.
Discret. Math.
Patcharapan Jumnongnit, Kittikorn Nakprasit, Watcharintorn Ruksasakchai, Pongpat Sittitrai
2025 J jnl
Partitioning Planar Graphs Without Specific Cycles into a Forest and a Disjoint Union of Paths.
Axioms
Pongpat Sittitrai, Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit
2025 J jnl
Planar Graphs Without 4-Cycles Are (6, 6)-Colorable.
Symmetry
Pongpat Sittitrai, Wannapol Pimpasalee, Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit
2025 J jnl
Proper Magic Sigma Coloring of Specific Graphs.
Comput. Sci. J. Moldova
Panuvit Chuaephon, Kittikorn Nakprasit
2024 J jnl
Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition.
Discret. Appl. Math.
Wipawee Tangjai, Kittikorn Nakprasit, Keaitsuda Maneeruk Nakprasit, Pongpat Sittitrai
2024 J jnl
Planar graphs without 4- and 6-cycles are (3,4)-colorable.
Discret. Appl. Math.
Kittikorn Nakprasit, Pongpat Sittitrai, Wannapol Pimpasalee
2023 J jnl
Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles.
Discuss. Math. Graph Theory
Sarawute Sribunhung, Keaitsuda Nakprasit, Kittikorn Nakprasit, Pongpat Sittitrai
2023 J jnl
Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles.
Theor. Comput. Sci.
Kittikorn Nakprasit, Watcharintorn Ruksasakchai, Pongpat Sittitrai
2022 J jnl
An analogue of DP-coloring for variable degeneracy and its applications.
Discuss. Math. Graph Theory
Pongpat Sittitrai, Kittikorn Nakprasit
2022 — conf
Estimating the Physical Parameters of Human Arm Motion from Video using Fixed-Point PCA Transform and Nonlinear Least-Squares Method.
ICFSP
Anupong Kanarach, Kittikorn Nakprasit, Banchar Arnonkijpanich
2022 J jnl
Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate.
Discret. Math.
Pongpat Sittitrai, Kittikorn Nakprasit
2022 J jnl
The Strong Equitable Vertex 1-Arboricity of Complete Bipartite Graphs and Balanced Complete k-Partite Graphs.
Symmetry
Janejira Laomala, Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit, Watcharintorn Ruksasakchai
2021 J jnl
Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate.
Discret. Math.
Pongpat Sittitrai, Kittikorn Nakprasit
2020 J jnl
A Generalization of Some Results on List Coloring and DP-Coloring.
Graphs Comb.
Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit
2020 J jnl
DP-4-colorability of planar graphs without adjacent cycles of given length.
Discret. Appl. Math.
Runrun Liu, Xiangwen Li, Kittikorn Nakprasit, Pongpat Sittitrai, Gexin Yu
2019 J jnl
Sufficient Conditions on Planar Graphs to Have a Relaxed DP-3-Coloring.
Graphs Comb.
Pongpat Sittitrai, Kittikorn Nakprasit
2018 J jnl
Defective 2-colorings of planar graphs without 4-cycles and 5-cycles.
Discret. Math.
Pongpat Sittitrai, Kittikorn Nakprasit
2018 J jnl
Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable.
CoRR
Pongpat Sittitrai, Kittikorn Nakprasit
2018 J jnl
The Game Coloring Number of Planar Graphs with a Specific Girth.
Graphs Comb.
Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit
2017 J jnl
Graphs with Bounded Maximum Average Degree and Their Neighbor Sum Distinguishing Total-Choice Numbers.
Int. J. Math. Math. Sci.
Patcharapan Jumnongnit, Kittikorn Nakprasit
2017 J jnl
The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs.
Inf. Process. Lett.
Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit
2015 J jnl
The strong chromatic index of graphs with restricted Ore-degrees.
Ars Comb.
Keaitsuda Nakprasit, Kittikorn Nakprasit
2014 J jnl
(2, t)-choosasble graphs.
Ars Comb.
Watcharintorn Ruksasakchai, Kittikorn Nakprasit
2014 J jnl
The strong chromatic index of graphs and subdivisions.
Discret. Math.
Keaitsuda Nakprasit, Kittikorn Nakprasit
2013 J jnl
On a conjecture about (k, t)-choosability.
Ars Comb.
Watcharintorn Ruksasakchai, Kittikorn Nakprasit
2012 J jnl
Equitable colorings of planar graphs with maximum degree at least nine.
Discret. Math.
Kittikorn Nakprasit
2012 J jnl
Equitable colorings of planar graphs without short cycles.
Theor. Comput. Sci.
Keaitsuda Nakprasit, Kittikorn Nakprasit
2008 J jnl
A note on the strong chromatic index of bipartite graphs.
Discret. Math.
Kittikorn Nakprasit
2008 J jnl
Coloring the complements of intersection graphs of geometric figures.
Discret. Math.
Seog-Jin Kim, Kittikorn Nakprasit
2008 J jnl
Packing d-degenerate graphs.
J. Comb. Theory B
Béla Bollobás, Alexandr V. Kostochka, Kittikorn Nakprasit
2006 J jnl
Transversal numbers of translates of a convex body.
Discret. Math.
Seog-Jin Kim, Kittikorn Nakprasit, Michael J. Pelsmajer, Jozef Skokan
2005 J jnl
On Equitable Coloring of d-Degenerate Graphs.
SIAM J. Discret. Math.
Alexandr V. Kostochka, Kittikorn Nakprasit, Sriram V. Pemmaraju
2005 J jnl
On equitable
Theor. Comput. Sci.
Alexandr V. Kostochka, Kittikorn Nakprasit
2004 J jnl
On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane.
Electron. J. Comb.
Seog-Jin Kim, Alexandr V. Kostochka, Kittikorn Nakprasit
2004 J jnl
On the Chromatic Number of the Square of the Kneser Graph
Graphs Comb.
Seog-Jin Kim, Kittikorn Nakprasit
2003 J jnl
Equitable Colourings Of D-Degenerate Graphs.
Comb. Probab. Comput.
Alexandr V. Kostochka, Kittikorn Nakprasit
2003 A* conf
Equitable colorings with constant number of colors.
SODA
Sriram V. Pemmaraju, Kittikorn Nakprasit, Alexandr V. Kostochka