Teeradej Kittipassorn

collaborators

2 papers

math.CO2023

Union vertex-distinguishing edge colorings

Teeradej Kittipassorn, Preechaya Sanyatit

The union vertex-distinguishing chromatic index $χ_{\cup}^{'} (G)$ of a graph $G$ is the smallest natural number $k$ such that the edges of $G$ can be assigned nonempty subsets of $[k]$ …

math.CO2014

Frustrated Triangles

Teeradej Kittipassorn, Gabor Meszaros

A triple of vertices in a graph is a \emph{frustrated triangle} if it induces an odd number of edges. We study the set $F_{n} \subset [0, (3 n)]$ of possible number of frustrated…