W. Ruksasakchai

collaborators

2 papers

math.CO2024

A simple proof on the number of $(3 \times n)$ -Latin rectangles based on a set of $λ$ elements

Pantaree Thengarnanchai, Pawaton Kaemawichanurat, Watcharintorn Ruksasakchai +1

In 1980, Athreya, Pranesachar and Singhi established the chromatic polynomial of $(3 \times n)$ -Latin rectangles whose entries based on a set ${1, 2, ..., λ}$ in which $λ \geq n$ .…

math.CO2021

The strong equitable vertex 1-arboricity of complete bipartite graphs and balanced complete k-partite graphs

Janejira Laomala, Keaitsuda Nakprasit, Kittikorn Nakprasit +1

An \emph{equitable $(q, r)$ -tree-coloring} of a graph $G$ is a $q$ -coloring of $G$ such that the subgraph induced by each color class is a forest of maximum degree at most $r$ and…

A simple proof on the number of (3×n)-Latin rectangles based on a set of λ elements

The strong equitable vertex 1-arboricity of complete bipartite graphs and balanced complete k-partite graphs

A simple proof on the number of $(3 \times n)$ -Latin rectangles based on a set of $λ$ elements