Loading
Assoc.Prof.Dr. Kittikorn Nakpasit

Assoc.Prof.Dr. Kittikorn Nakpasit

ภาควิชาคณิตศาสตร์,
Faculty of Science,
Khon Kaen University
55943201500: H-INDEX 8

Documents

TCI อ้างอิงจาก http://www.tci-thaijo.org/

0

SCOPUS

0

PUBMED

0

ISI

0

TCI

Title Author Year SCOPUS PUBMED ISI TCI
1. Equitable colorings with constant number of colors Nakprasit, K. 2003
2. Equitable colourings of d-degenerate graphs Nakprasit, K. 2003
3. On the chromatic number of intersection graphs of convex sets in the plane Kim, S.
Nakprasit, K.
2004
4. On the Chromatic Number of the Square of the Kneser Graph K(2k + 1, k) Kim, S.
Nakprasit, K.
2004
5. On equitable coloring of d-degenerate graphs Nakprasit, K. 2005
6. On equitable Δ-coloring of graphs with low average degree Nakprasit, K. 2005
7. On two conjectures on packing of graphs Nakprasit, K. 2005
8. Transversal numbers of translates of a convex body Kim, S.
Nakprasit, K.
2006
9. A note on the strong chromatic index of bipartite graphs Nakprasit, K. 2008
10. Coloring the complements of intersection graphs of geometric figures Kim, S.
Nakprasit, K.
2008
11. Packing d-degenerate graphs Nakprasit, K. 2008
12. Weak and strong convergence theorems of in implicit iteration process for a countable family of nonexpansive mappings Nakprasit, K.
Nilsrakoo, W.
Saejung, S.
2008
13. Equitable colorings of planar graphs with maximum degree at least nine Nakprasit, K. 2012
14. Equitable colorings of planar graphs without short cycles Nakprasit, K.
Nakprasit, K.
2012
15. Incidence colorings of the powers of cycles Nakprasit, K.
Nakprasit, K.
2012
16. On a conjecture about (k, t)-choosability Ruksasakchai, W.
Nakprasit, K.
2013
17. (2, t)-choosable graphs Ruksasakcnai, W.
Nakprasit, K.
2014
18. Graceful labeling of some classes of spider graphs with three legs greater than one Jampachon, P.
Nakprasit, K.
Poomsa-Ard, T.
2014
19. The strong chromatic index of graphs and subdivisions Nakprasit, K.
Nakprasit, K.
2014
20. Graphs with Bounded Maximum Average Degree and Their Neighbor Sum Distinguishing Total-Choice Numbers Nakprasit, K. 2017
21. The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs Nakprasit, K.
Nakprasit, K.
2017
22. Defective 2-colorings of planar graphs without 4-cycles and 5-cycles Nakprasit, K. 2018
23. The Game Coloring Number of Planar Graphs with a Specific Girth Nakprasit, K.
Nakprasit, K.M.
2018
24. Sufficient Conditions on Planar Graphs to Have a Relaxed DP-3-Coloring Nakprasit, K. 2019
25. A Generalization of Some Results on List Coloring and DP-Coloring Nakprasit, K.M.
Nakprasit, K.
2020
26. An Analogue of DP-Coloring for Variable Degeneracy and its Applications Nakprasit, K. 2020
27. DP-4-colorability of planar graphs without adjacent cycles of given length Nakprasit, K. 2020
28. Every Planar Graph Without Pairwise Adjacent 3-, 4-, and 5-Cycle is DP-4-Colorable Nakprasit, K. 2020
Count 28 0 0 0

Title Authors Year Publication name Cited count
< 2015 2016 2017 2018 2019 2020 Total
1. Equitable colorings with constant number of colors Nakprasit, K. 2003 Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
(), pp. 458-459
2. Equitable colourings of d-degenerate graphs Nakprasit, K. 2003 Combinatorics Probability and Computing
1 (12), pp. 53-60
3. On the chromatic number of intersection graphs of convex sets in the plane Kim, S.
Nakprasit, K.
2004 Electronic Journal of Combinatorics
1 R (11), pp. 1-12
4. On the Chromatic Number of the Square of the Kneser Graph K(2k + 1, k) Kim, S.
Nakprasit, K.
2004 Graphs and Combinatorics
1 (20), pp. 79-90
5. On equitable coloring of d-degenerate graphs Nakprasit, K. 2005 SIAM Journal on Discrete Mathematics
1 (19), pp. 83-95
6. On equitable Δ-coloring of graphs with low average degree Nakprasit, K. 2005 Theoretical Computer Science
1 (349), pp. 82-91
7. On two conjectures on packing of graphs Nakprasit, K. 2005 Combinatorics Probability and Computing
5-6 (14), pp. 723-736
8. Transversal numbers of translates of a convex body Kim, S.
Nakprasit, K.
2006 Discrete Mathematics
18 (306), pp. 2166-2173
9. A note on the strong chromatic index of bipartite graphs Nakprasit, K. 2008 Discrete Mathematics
16 (308), pp. 3726-3728
10. Coloring the complements of intersection graphs of geometric figures Kim, S.
Nakprasit, K.
2008 Discrete Mathematics
20 (308), pp. 4589-4594
11. Packing d-degenerate graphs Nakprasit, K. 2008 Journal of Combinatorial Theory. Series B
1 (98), pp. 85-94
12. Weak and strong convergence theorems of in implicit iteration process for a countable family of nonexpansive mappings Nakprasit, K.
Nilsrakoo, W.
Saejung, S.
2008 Fixed Point Theory and Applications
(2008), pp.
13. Equitable colorings of planar graphs with maximum degree at least nine Nakprasit, K. 2012 Discrete Mathematics
5 (312), pp. 1019-1024
14. Equitable colorings of planar graphs without short cycles Nakprasit, K.
Nakprasit, K.
2012 Theoretical Computer Science
(465), pp. 21-27
15. Incidence colorings of the powers of cycles Nakprasit, K.
Nakprasit, K.
2012 International Journal of Pure and Applied Mathematics
1 (76), pp. 143-148
16. On a conjecture about (k, t)-choosability Ruksasakchai, W.
Nakprasit, K.
2013 Ars Combinatoria
(111), pp. 375-387
17. (2, t)-choosable graphs Ruksasakcnai, W.
Nakprasit, K.
2014 Ars Combinatoria
(113), pp. 307-319
18. Graceful labeling of some classes of spider graphs with three legs greater than one Jampachon, P.
Nakprasit, K.
Poomsa-Ard, T.
2014 Thai Journal of Mathematics
3 (12), pp. 621-630
19. The strong chromatic index of graphs and subdivisions Nakprasit, K.
Nakprasit, K.
2014 Discrete Mathematics
1 (317), pp. 75-78
20. Graphs with Bounded Maximum Average Degree and Their Neighbor Sum Distinguishing Total-Choice Numbers Nakprasit, K. 2017 International Journal of Mathematics and Mathematical Sciences
(2017), pp.
21. The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs Nakprasit, K.
Nakprasit, K.
2017 Information Processing Letters
(117), pp. 40-44
22. Defective 2-colorings of planar graphs without 4-cycles and 5-cycles Nakprasit, K. 2018 Discrete Mathematics
8 (341), pp. 2142-2150
23. The Game Coloring Number of Planar Graphs with a Specific Girth Nakprasit, K.
Nakprasit, K.M.
2018 Graphs and Combinatorics
2 (34), pp. 349-354
24. Sufficient Conditions on Planar Graphs to Have a Relaxed DP-3-Coloring Nakprasit, K. 2019 Graphs and Combinatorics
4 (35), pp. 837-845
25. A Generalization of Some Results on List Coloring and DP-Coloring Nakprasit, K.M.
Nakprasit, K.
2020 Graphs and Combinatorics
(), pp.
26. An Analogue of DP-Coloring for Variable Degeneracy and its Applications Nakprasit, K. 2020 Discussiones Mathematicae - Graph Theory
(), pp.
27. DP-4-colorability of planar graphs without adjacent cycles of given length Nakprasit, K. 2020 Discrete Applied Mathematics
(277), pp. 245-251
28. Every Planar Graph Without Pairwise Adjacent 3-, 4-, and 5-Cycle is DP-4-Colorable Nakprasit, K. 2020 Bulletin of the Malaysian Mathematical Sciences Society
3 (43), pp. 2271-2285

Title Authors Year Journal title

Title Authors Year Journal title Cited count
< 2015 2016 2017 2018 2019 2020 Total

Title Authors Year Journal title

Title Authors NRIIS type Year NRIIS Scholarship
1. การให้สีในลักษณะเกมแบบเท่าเทียม รศ.ดร. กิตติกร นาคประสิทธิ์
โครงการ 2557 ทุนงบประมาณแผ่นดินประจำปี 2557

0.045588016510009766