# | Document title | Authors | Year | Source | Cited by |
1 | Strong chromatic index of subcubic planar multigraphs | Kostochka A., Li X., Ruksasakchai W., Santana M., Wang T., Wang T., Yu G., Yu G. | 2016 | European Journal of Combinatorics 51,pp. 380-397 | 23 |
2 | Game domination numbers of a disjoint union of paths and cycles | Ruksasakchai W., Onphaeng K., Worawannotai C. | 2019 | Quaestiones Mathematicae 42(10),pp. 1357-1372 | 12 |
3 | Distance restricted matching extension missing vertices and edges in 5-connected triangulations of the plane | Aldred R.E.L., Plummer M.D., Ruksasakchai W. | 2020 | Journal of Graph Theory 95(2),pp. 240-255 | 5 |
4 | List strong edge coloring of some classes of graphs | Ruksasakchai W., Wang T. | 2017 | Australasian Journal of Combinatorics 68(1),pp. 106-117 | 5 |
5 | On a conjecture about (k, t)-choosability | Ruksasakchai W., Nakprasit K. | 2013 | Ars Combinatoria 111,pp. 375-387 | 3 |
6 | (2, t)-choosable graphs | Ruksasakcnai W., Nakprasit K. | 2014 | Ars Combinatoria 113,pp. 307-319 | 3 |
7 | Competition-independence game and domination game | Worawannotai C., Ruksasakchai W. | 2020 | Mathematics 8(3) | 2 |
8 | Restricted matching in plane triangulations and near triangulations | Aldred R.E.L., Plummer M.D., Ruksasakchai W. | 2020 | Discrete Applied Mathematics 284,pp. 251-261 | 0 |
9 | Asymmetric distance matching extension in 5-connected even planar triangulations | Aldred R.E.L., Plummer M.D., Ruksasakchai W. | 2021 | Australasian Journal of Combinatorics 79,pp. 1-14 | 0 |
10 | The Strong Equitable Vertex 1-Arboricity of Complete Bipartite Graphs and Balanced Complete k-Partite Graphs | Laomala J., Nakprasit K.M., Nakprasit K., Ruksasakchai W. | 2022 | Symmetry 14(2) | 0 |
11 | Sufficient Conditions of 6-Cycles Make Planar Graphs DP-4-Colorable | Nakprasit K., Ruksasakchai W., Sittitrai P. | 2022 | Mathematics 10(15) | 0 |
12 | Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles | Nakprasit K., Ruksasakchai W., Sittitrai P. | 2022 | Theoretical Computer Science
| 0 |
13 | Sufficient Conditions make Graphs Edge DP-Δ-Colorable | Ruksasakchai W., Sittitrai P., Sittitrai P. | 2025 | Graphs and Combinatorics 41(1) | 0 |
14 | Edge DP-coloring of planar graphs without 4-cycles and specific cycles | Jumnongnit P., Nakprasit K., Nakprasit K., Ruksasakchai W., Sittitrai P., Sittitrai P. | 2025 | Discrete Mathematics 348(4) | 0 |
15 | On independent domination critical graphs and k-factor critical | Ananchuen N., Ananchuen N., Ruksasakchai W., Ananchuen W. | 2016 | Ars Combinatoria 126,pp. 109-115 | 0 |