7 citations · 9 across the 14 of their papers we have counts for
18 papers
Congruences via Partitions with Exactly Two Part Sizes
Sittinon Jirattikansakul, Teeradej Kittipassorn, Kraiwich Kongsiri +2
We prove the congruence , where denotes the number of positive divisors of , for with $(A,B) \in…
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…
The -packing coloring of the infinite diagonal grid with
Teeradej Kittipassorn, Peerawit Suriya
For a non-decreasing sequence of positive integers , the -packing chromatic number of a graph is the smallest positive integer such that the verti…
A Size Condition for Small Diameter Orientable Graphs
Sopon Boriboon, Teeradej Kittipassorn
In 2002, Koh and Tay conjectured that every bridgeless graph of order and size at least has an orientation of diameter two. Later, Cochran, Czabarka, D…
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…
An Isoperimetric Inequality and Pursuit-Evasion Games on Triangular Grid Graphs
Athipatana Iamphongsai, Teeradej Kittipassorn
In this paper, we prove an isoperimetric inequality for the triangular grid graph which was conjectured by Adams, Gibson, and Pfaffinger, using the compression technique of Bollobá…
Union vertex-distinguishing edge colorings
Teeradej Kittipassorn, Preechaya Sanyatit
The union vertex-distinguishing chromatic index of a graph is the smallest natural number such that the edges of can be assigned nonempty subsets of …
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,…
Partite Saturation of Complete Graphs
António Girão, Teeradej Kittipassorn, Kamil Popielarz
We study the problem of determining , the minimum number of edges in a -partite graph with vertices in each part such that is -free but the addition…
Generalised Majority Colourings of Digraphs
António Girão, Teeradej Kittipassorn, Kamil Popielarz
The purpose of this note is to draw attention to problems related to a concept called majority colouring recently studied by Kreutzer, Oum, Seymour, van der Zypen and Wood. They ra…
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 of possible number of frustrated…
Disjoint induced subgraphs of the same order and size
Béla Bollobás, Teeradej Kittipassorn, Bhargav Narayanan +1
For a graph , let be the largest integer for which there exist two vertex-disjoint induced subgraphs of each on vertices, both inducing the same number of edg…
Separating path systems
Victor Falgas-Ravry, Teeradej Kittipassorn, Dániel Korándi +2
We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every -vertex graph admits a separating path system…