Natawat Klamsakul

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.CO2022

Maximal Independent Sets in Polygonal Cacti

Natawat Klamsakul, Pantaree Thengarnanchai, Mattanaporn Suebtangjai +3

Counting the number of maximal independent sets of graphs was started over $50$ years ago by Erdős and Mooser. The problem has been continuously studied with a number of variations…

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

Maximal Independent Sets in Polygonal Cacti

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