Loading
Assoc.Prof.Dr. Kittikorn Nakpasit

Assoc.Prof.Dr. Kittikorn Nakpasit

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

Documents

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

0

SCOPUS

0

PUBMED

0

ISI

0

TCI
Created with Highcharts 4.0.4SCOPUSPUBMEDISITCI

TitleAuthorYearSCOPUSPUBMEDISITCI
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
Count28000

JavaScript chart by amCharts 3.20.7

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

PLANAR GRAPHPLANAR GRAPHSCYCLEEQUITABLE COLORINGDP-COLORINGGIRTHD-DEGENERATE GRAPHSINTERSECTION GRAPHGRAPH COLORINGDP-COLORINGSLIST COLORINGINCIDENCE COLORINGSTRONG EDGE-COLORINGGRACEFUL LABELINGINVERSE TRANSFORMATINSPIDER GRAPHSGRAPH PACKINGMAXIMUM DEGREECONVEXHOMOTHETYTRANSVERSAL NUMBERAVERAGE DEGREEBROOKS' THEOREMCOMBINATORIAL PROBLEMSCOMPLETE BIPARTITE GRAPHSCOMPLETE TRIPARTITE GRAPHSGRAPH ALGORITHMSVERTEX K-ARBORICITYINTERSECTING FAMILYKNESER GRAPHSQUAREGAME CHROMATIC NUMBERGAME COLORING NUMBEREQUITABLE COLORINGSIMPROPER COLORINGSCYCLESLIST COLORINGS05C15DEFECTIVE COLORINGARBORICITY COLORINGSVARIABLE DEGENERACYVERTEX PARTITIONSTRONG CHROMATIC INDEXSUBDIVISIONPOWERS OF CYCLESINDUCED MATCHINGCHROMATIC NUMBERCOMPLEMENTCONVEX SET

0.07295060157775879