Teeradej Kittipassorn

According to our database, Teeradej Kittipassorn authored at least 9 papers between 2014 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

On the existence of zero-sum perfect matchings of complete graphs.

Teeradej Kittipassorn, Panon Sinsap

Ars Math. Contemp., January, 2023

The graph grabbing game on blow-ups of trees and cycles.

Sopon Boriboon, Teeradej Kittipassorn

Discuss. Math. Graph Theory, 2023

Union vertex-distinguishing edge colorings.

Teeradej Kittipassorn, Preechaya Sanyatit

CoRR, 2023

2019

Partite Saturation of Complete Graphs.

António Girão, Teeradej Kittipassorn, Kamil Popielarz

SIAM J. Discret. Math., 2019

2017

Generalized Majority Colourings of Digraphs.

António Girão, Teeradej Kittipassorn, Kamil Popielarz

Comb. Probab. Comput., 2017

2015

Approximations to <i>m</i>-Colored Complete Infinite Hypergraphs.

Teeradej Kittipassorn, Bhargav P. Narayanan

J. Graph Theory, 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

Frustrated triangles.

Teeradej Kittipassorn, Gábor Mészáros

Discret. Math., 2015

2014

A Canonical Ramsey Theorem for Exactly <i>m</i>-Coloured Complete Subgraphs.

Teeradej Kittipassorn, Bhargav P. Narayanan

Comb. Probab. Comput., 2014