| Title | Author | Year | SCOPUS | PUBMED | ISI | TCI | |
|---|---|---|---|---|---|---|---|
| 1. | Defective 2-colorings of planar graphs without 4-cycles and 5-cycles | Pongpat Sittitrai Kittikorn Nakprasit |
2018 | ||||
| 2. | Sufficient Conditions on Planar Graphs to Have a Relaxed DP-3-Coloring | Pongpat Sittitrai Kittikorn Nakprasit |
2019 | ||||
| 3. | An Analogue of DP-Coloring for Variable Degeneracy and its Applications | Nakprasit, K. | 2020 | ||||
| 4. | DP-4-colorability of planar graphs without adjacent cycles of given length | Runrun Liu Xiangwen Li Kittikorn Nakprasit Pongpat Sittitrai Gexin Yu |
2020 | ||||
| 5. | Every Planar Graph Without Pairwise Adjacent 3-, 4-, and 5-Cycle is DP-4-Colorable | Nakprasit, K. | 2020 | ||||
| 6. | Defective DP-colorings of sparse multigraphs | Yifan Jing Alexandr Kostochka Fuhong Ma Pongpat Sittitrai Jingwei Xu |
2021 | ||||
| 7. | Planar Graphs Without Pairwise Adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable | Kittikorn Nakprasit Pongpat Sittitrai |
2021 | ||||
| 8. | Relaxed DP-Coloring and another Generalization of DP-Coloring on Planar Graphs without 4-Cycles and 7-Cycles | Nakprasit, K.M. Nakprasit, K. Sittitrai, P. |
2021 | ||||
| 9. | Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate | Sittitrai, P. Nakprasit, K. |
2021 | ||||
| 10. | Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate | Sittitrai, P. Nakprasit, K. |
2022 | ||||
| 11. | Sufficient Conditions of 6-Cycles Make Planar Graphs DP-4-Colorable | Nakprasit, K. Ruksasakchai, W. Sittitrai, P. |
2022 | Count | 9 | 0 | 7 | 0 |
| Title | Authors | Year | Publication name | Cited count | ||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| < 2017 | 2018 | 2019 | 2020 | 2021 | 2022 | รวม | ||||||
| 1. | Defective 2-colorings of planar graphs without 4-cycles and 5-cycles | Nakprasit, K. | 2018 |
Discrete Mathematics 8 (341), pp. 2142-2150 |
||||||||
| 2. | Sufficient Conditions on Planar Graphs to Have a Relaxed DP-3-Coloring | Nakprasit, K. | 2019 |
Graphs and Combinatorics 4 (35), pp. 837-845 |
||||||||
| 3. | An Analogue of DP-Coloring for Variable Degeneracy and its Applications | Nakprasit, K. | 2020 |
Discussiones Mathematicae - Graph Theory (), pp. |
||||||||
| 4. | DP-4-colorability of planar graphs without adjacent cycles of given length | Nakprasit, K. | 2020 |
Discrete Applied Mathematics (277), pp. 245-251 |
||||||||
| 5. | 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 |
||||||||
| 6. | Relaxed DP-Coloring and another Generalization of DP-Coloring on Planar Graphs without 4-Cycles and 7-Cycles | Nakprasit, K.M. Nakprasit, K. Sittitrai, P. |
2021 |
Discussiones Mathematicae - Graph Theory (), pp. |
||||||||
| 7. | Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate | Sittitrai, P. Nakprasit, K. |
2021 |
Discrete Mathematics 11 (344), pp. |
||||||||
| 8. | Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate | Sittitrai, P. Nakprasit, K. |
2022 |
Discrete Mathematics 9 (345), pp. |
||||||||
| 9. | Sufficient Conditions of 6-Cycles Make Planar Graphs DP-4-Colorable | Nakprasit, K. Ruksasakchai, W. Sittitrai, P. |
2022 |
Mathematics 15 (10), pp. |
||||||||
| Title | Authors | Year | Journal title |
|---|
| Title | Authors | Year | Journal title | Cited count | ||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| < 2017 | 2018 | 2019 | 2020 | 2021 | 2022 | รวม | ||||||
| 1. | Defective 2-colorings of planar graphs without 4-cycles and 5-cycles | Pongpat Sittitrai Kittikorn Nakprasit |
2018 |
DISCRETE MATHEMATICS 8.0 (341.0), pp. 2142.0-2150.0 |
5 | 0 | 0 | 0 | 0 | 0 | 5 | |
| 2. | Sufficient Conditions on Planar Graphs to Have a Relaxed DP-3-Coloring | Pongpat Sittitrai Kittikorn Nakprasit |
2019 |
GRAPHS AND COMBINATORICS 4.0 (35.0), pp. 837.0-845.0 |
0 | 0 | 0 | 0 | 0 | 0 | 0 | |
| 3. | DP-4-colorability of planar graphs without adjacent cycles of given length | Runrun Liu Xiangwen Li Kittikorn Nakprasit Pongpat Sittitrai Gexin Yu |
2020 |
DISCRETE APPLIED MATHEMATICS (277.0), pp. 245.0-251.0 |
6 | 0 | 0 | 0 | 0 | 0 | 6 | |
| 4. | Every Planar Graph Without Pairwise Adjacent 3-, 4-, and 5-Cycle is DP-4-Colorable | Pongpat Sittitrai Kittikorn Nakprasit |
2020 |
BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY 3.0 (43.0), pp. 2271.0-2285.0 |
4 | 0 | 0 | 0 | 0 | 0 | 4 | |
| 5. | Defective DP-colorings of sparse multigraphs | Yifan Jing Alexandr Kostochka Fuhong Ma Pongpat Sittitrai Jingwei Xu |
2021 |
EUROPEAN JOURNAL OF COMBINATORICS (93.0), pp. |
0 | 0 | 0 | 0 | 0 | 0 | 0 | |
| 6. | Planar Graphs Without Pairwise Adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable | Kittikorn Nakprasit Pongpat Sittitrai |
2021 |
TAIWANESE JOURNAL OF MATHEMATICS 6.0 (25.0), pp. 1113.0-1135.0 |
0 | 0 | 0 | 0 | 0 | 0 | 0 | |
| 7. | Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate | Pongpat Sittitrai Kittikorn Nakprasit |
2021 |
DISCRETE MATHEMATICS 11.0 (344.0), pp. |
0 | 0 | 0 | 0 | 0 | 0 | 0 | |
| Title | Authors | Year | Journal title |
|---|
| ชื่อโครงการ | Authors | ประเภทโครงการ | ปีงบประมาณ | ทุนวิจับ |
|---|