| Title | Author | Year | SCOPUS | PUBMED | ISI | TCI | |
|---|---|---|---|---|---|---|---|
| 1. | Defective 2-colorings of planar graphs without 4-cycles and 5-cycles | Nakprasit, K. | 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 | Jing, Y. Sittitrai, P. |
2021 | ||||
| 7. | Planar Graphs Without Pairwise Adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable | Nakprasit, K. Sittitrai, P. |
2021 | ||||
| 8. | Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate | Pongpat Sittitrai Kittikorn Nakprasit |
2021 | ||||
| 9. | Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate | Sittitrai, P. Nakprasit, K. |
2022 | ||||
| 10. | Sufficient Conditions of 6-Cycles Make Planar Graphs DP-4-Colorable | Nakprasit, K. Ruksasakchai, W. Sittitrai, P. |
2022 | ||||
| 11. | A Weak DP-Partitioning of Planar Graphs without 4-Cycles and 6-Cycles | Sittitrai, P. Nakprasit, K.M. Nakprasit, K. |
2023 | ||||
| 12. | 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. |
2023 | ||||
| 13. | Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles | Nakprasit, K. Ruksasakchai, W. Sittitrai, P. |
2023 | ||||
| 14. | Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition | Tangjai, W. Nakprasit, K. Nakprasit, K.M. Sittitrai, P. |
2024 | ||||
| 15. | Planar graphs without 4- and 6-cycles are (3,4)-colorable | Nakprasit, K. Sittitrai, P. Pimpasalee, W. |
2024 | ||||
| 16. | Planar Graphs without Cycles of Length 3, 4, and 6 are (3, 3)-Colorable | Sittitrai, P. Pimpasalee, W. |
2024 | Count | 16 | 0 | 7 | 0 |
| Title | Authors | Year | Publication name | Cited count | ||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| < 2020 | 2021 | 2022 | 2023 | 2024 | 2025 | Total | ||||||
| 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. | Defective DP-colorings of sparse multigraphs | Jing, Y. Sittitrai, P. |
2021 |
European Journal of Combinatorics (93), pp. |
||||||||
| 7. | Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable | Nakprasit, K. Sittitrai, P. |
2021 |
Taiwanese Journal of Mathematics 6 (25), pp. 1113-1135 |
||||||||
| 8. | 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. |
||||||||
| 9. | Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate | Sittitrai, P. Nakprasit, K. |
2022 |
Discrete Mathematics 9 (345), pp. |
||||||||
| 10. | Sufficient Conditions of 6-Cycles Make Planar Graphs DP-4-Colorable | Nakprasit, K. Ruksasakchai, W. Sittitrai, P. |
2022 |
Mathematics 15 (10), pp. |
||||||||
| 11. | A Weak DP-Partitioning of Planar Graphs without 4-Cycles and 6-Cycles | Sittitrai, P. Nakprasit, K.M. Nakprasit, K. |
2023 |
Bulletin of the Malaysian Mathematical Sciences Society 4 (46), pp. |
||||||||
| 12. | 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. |
2023 |
Discussiones Mathematicae - Graph Theory 1 (43), pp. 287-297 |
||||||||
| 13. | Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles | Nakprasit, K. Ruksasakchai, W. Sittitrai, P. |
2023 |
Theoretical Computer Science (941), pp. 131-139 |
||||||||
| 14. | Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition | Tangjai, W. Nakprasit, K. Nakprasit, K.M. Sittitrai, P. |
2024 |
Discrete Applied Mathematics (342), pp. 347-354 |
||||||||
| 15. | Planar graphs without 4- and 6-cycles are (3,4)-colorable | Nakprasit, K. Sittitrai, P. Pimpasalee, W. |
2024 |
Discrete Applied Mathematics (356), pp. 44-51 |
||||||||
| 16. | Planar Graphs without Cycles of Length 3, 4, and 6 are (3, 3)-Colorable | Sittitrai, P. Pimpasalee, W. |
2024 |
International Journal of Mathematics and Mathematical Sciences (2024), pp. |
||||||||
| Title | Authors | Year | Journal title |
|---|
| Title | Authors | Year | Journal title | Cited count | ||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| < 2020 | 2021 | 2022 | 2023 | 2024 | 2025 | Total | ||||||
| 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 |
|---|
| Title | Authors | NRIIS type | Year | NRIIS Scholarship |
|---|