Teeradej Kittipassorn

collaborators

5 papers

math.NT2026

Congruences via Partitions with Exactly Two Part Sizes

Sittinon Jirattikansakul, Teeradej Kittipassorn, Kraiwich Kongsiri +2

We prove the congruence $\sum_{1 \leq k < N} I ¨ _{0} (N - k^{2}) \equiv 0 (mod 4)$ , where $I ¨ _{0} (m)$ denotes the number of positive divisors of $m$ , for $N = A n + B$ with $(A,B) \…

math.CO2025

Multipartite and Structural Results on Transparent Rectangle Visibility Graphs

Siraphob Buahong, Teeradej Kittipassorn, Jiratchaphat Nanta +2

We consider a graph representation in the plane, called the transparent rectangle visibility graph (TRVG), where each vertex is represented by a rectangle in the plane with sides p…

math.CO2025

The $S$ -packing coloring of the infinite diagonal grid with $S = (1, 6, 6, \dots)$

Teeradej Kittipassorn, Peerawit Suriya

For a non-decreasing sequence of positive integers $S = (a_{1}, a_{2}, \dots)$ , the $S$ -packing chromatic number of a graph $G$ is the smallest positive integer $k$ such that the verti…

math.CO2025

A Size Condition for Small Diameter Orientable Graphs

Sopon Boriboon, Teeradej Kittipassorn

In 2002, Koh and Tay conjectured that every bridgeless graph of order $n \geq 5$ and size at least $(2 n) - n + 5$ has an orientation of diameter two. Later, Cochran, Czabarka, D…

math.CO2025

Transparent Rectangle Visibility Graphs

Chaipattana Juntarapomdach, Teeradej Kittipassorn

A transparent rectangle visibility graph (TRVG) is a graph whose vertices can be represented by a collection of non-overlapping rectangles in the plane whose sides are parallel to…

Congruences via Partitions with Exactly Two Part Sizes

Multipartite and Structural Results on Transparent Rectangle Visibility Graphs

The S-packing coloring of the infinite diagonal grid with S=(1,6,6,…)

A Size Condition for Small Diameter Orientable Graphs

Transparent Rectangle Visibility Graphs

The $S$ -packing coloring of the infinite diagonal grid with $S = (1, 6, 6, \dots)$