Watcharintorn Ruksasakchai

According to our database, Watcharintorn Ruksasakchai authored at least 10 papers between 2013 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles.

Kittikorn Nakprasit, Watcharintorn Ruksasakchai, Pongpat Sittitrai

Theor. Comput. Sci., 2023

2022

The Strong Equitable Vertex 1-Arboricity of Complete Bipartite Graphs and Balanced Complete k-Partite Graphs.

Janejira Laomala, Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit, Watcharintorn Ruksasakchai

Symmetry, 2022

2021

Asymmetric distance matching extension.

Robert E. L. Aldred, Michael D. Plummer, Watcharintorn Ruksasakchai

Australas. J Comb., 2021

2020

Distance restricted matching extension missing vertices and edges in 5-connected triangulations of the plane.

Robert E. L. Aldred, Michael D. Plummer, Watcharintorn Ruksasakchai

J. Graph Theory, 2020

Restricted matching in plane triangulations and near triangulations.

Robert E. L. Aldred, Michael D. Plummer, Watcharintorn Ruksasakchai

Discret. Appl. Math., 2020

2017

List strong edge coloring of some classes of graphs.

Watcharintorn Ruksasakchai, Tao Wang

Australas. J Comb., 2017

2016

Strong chromatic index of subcubic planar multigraphs.

Alexandr V. Kostochka, Xiaodong Li, Watcharintorn Ruksasakchai, Michael Santana, Tao Wang, G. Yu

Eur. J. Comb., 2016

On independent domination critical graphs and k-factor critical.

Nawarat Ananchuen, Watcharintorn Ruksasakchai, Watcharaphong Ananchuen

Ars Comb., 2016

2014

(2, t)-choosasble graphs.

Watcharintorn Ruksasakchai, Kittikorn Nakprasit

Ars Comb., 2014

2013

On a conjecture about (k, t)-choosability.

Watcharintorn Ruksasakchai, Kittikorn Nakprasit

Ars Comb., 2013