3 citations · 3 across the 4 of their papers we have counts for
4 papers
A simple proof on the number of -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 -Latin rectangles whose entries based on a set in which .…
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 -tree-coloring} of a graph is a -coloring of such that the subgraph induced by each color class is a forest of maximum degree at most and…
Strong chromatic index of subcubic planar multigraphs
A. V. Kostochka, X. Li, W. Ruksasakchai +3
The strong chromatic index of a multigraph is the minimum such that the edge set can be -colored requiring that each color class induces a matching. We verify a conjecture o…
List strong edge coloring of some classes of graphs
Watcharintorn Ruksasakchai, Tao Wang
A {\em strong edge coloring} of a graph is a proper edge coloring in which every color class is an induced matching. The {\em strong chromatic index} of a graph is the minimum numb…