1 citations · 1 across the 3 of their papers we have counts for
7 papers
Multithreshold multipartite graphs with small parts
Teeradej Kittipassorn, Thanaporn Sumalroj
A graph is a -threshold graph with thresholds if we can assign a real number to each vertex such that for any two distinct vertices and ,…
Monochromatic Edges in Complete Multipartite Hypergraphs
Teeradej Kittipassorn, Boonpipop Sirirojrattana
Consider the following problem. In a school with three classes containing students each, given that their genders are unknown, find the minimum possible number of triples of sa…
On the Existence of Zero-Sum Perfect Matchings of Complete Graphs
Teeradej Kittipassorn, Panon Sinsap
In this paper, we prove that given a 2-edge-coloured complete graph that has the same number of edges of each colour, we can always find a perfect matching with an equal n…
The graph grabbing game on blow-ups of trees and cycles
Sopon Boriboon, Teeradej Kittipassorn
The graph grabbing game is played on a non-negatively weighted connected graph by Alice and Bob who alternately claim a non-cut vertex from the remaining graph, where Alice plays f…
A strategy for Isolator in the Toucher-Isolator game on trees
Sopon Boriboon, Teeradej Kittipassorn
In the Toucher-Isolator game, introduced recently by Dowden, Kang, Mikalački and Stojaković, Toucher and Isolator alternately claim an edge from a graph such that Toucher aims to t…
Long cycles in Hamiltonian graphs
António Girão, Teeradej Kittipassorn, Bhargav Narayanan
We prove that if an -vertex graph with minimum degree at least contains a Hamiltonian cycle, then it contains another cycle of length ; this implies, in particular,…