A Canonical Ramsey Theorem for Exactly m-Coloured Complete Subgraphs. - Teeradej Kittipassorn; Bhargav P. Narayanan (Comb. Probab. Comput., 2014)

Frustrated triangles. - Teeradej Kittipassorn; Gábor Mészáros (Discret. Math., 2015)

Disjoint induced subgraphs of the same order and size. - Béla Bollobás; Teeradej Kittipassorn; Bhargav P. Narayanan; Alexander D. Scott (Eur. J. Comb., 2015)

Approximations to m-Colored Complete Infinite Hypergraphs. - Teeradej Kittipassorn; Bhargav P. Narayanan (J. Graph Theory, 2015)

Generalized Majority Colourings of Digraphs. - António Girão; Teeradej Kittipassorn; Kamil Popielarz (Comb. Probab. Comput., 2017)

Partite Saturation of Complete Graphs. - António Girão; Teeradej Kittipassorn; Kamil Popielarz (SIAM J. Discret. Math., 2019)

The graph grabbing game on blow-ups of trees and cycles. - Sopon Boriboon; Teeradej Kittipassorn (Discuss. Math. Graph Theory, 2023)

On the existence of zero-sum perfect matchings of complete graphs. - Teeradej Kittipassorn; Panon Sinsap (Ars Math. Contemp., 2023)

Multithreshold multipartite graphs with small parts. - Teeradej Kittipassorn; Thanaporn Sumalroj (Discret. Math., 2024)

Union vertex-distinguishing edge colorings. - Teeradej Kittipassorn; Preechaya Sanyatit (Discret. Math., 2024)

An isoperimetric inequality and pursuit-evasion games on triangular grid graphs. - Athipatana Iamphongsai; Teeradej Kittipassorn (Discret. Appl. Math., 2025)