Chira Lumduanhom
Western Michigan University
Graphs and Combinatorics | 2017
Eric Andrews; Gary Chartrand; Chira Lumduanhom; Ping Zhang
For bipartite graphs F and H with Ramsey number
Discussiones Mathematicae Graph Theory | 2014
Eric Andrews; Futaba Fujie; Kyle Kolasinski; Chira Lumduanhom; Adam Yusko
Discussiones Mathematicae Graph Theory | 2014
Eric Andrews; Chira Lumduanhom; Ping Zhang
R(F, H) = n
Bulletin of the Institute of Combinatorics and its Applications | 2013
Eric Andrews; Gary Chartrand; Chira Lumduanhom; Ping Zhang
Ars Combinatoria | 2018
Daniel Johnston; Chira Lumduanhom; Ping Zhang
R(F,H)=n and an integer k with
The journal of combinatorial mathematics and combinatorial computing | 2015
Eric Andrews; Chira Lumduanhom; Ping Zhang
Ars Combinatoria | 2015
Kyle Kolasinski; Jianwei Lin; Chira Lumduanhom; Bryan Phinezy; Futaba Okamoto
2 \le k \le n
Utilitas Mathematica | 2014
Eric Andrews; Gary Chartrand; Chira Lumduanhom; Ping Zhang
The journal of combinatorial mathematics and combinatorial computing | 2014
Eric Andrews; Chira Lumduanhom; Ping Zhang
2≤k≤n, the k-Ramsey number of F and H is the minimum order of a balanced complete k-partite graph G for which every red-blue coloring of G results in a subgraph of G isomorphic to F all of whose edges are colored red or a subgraph isomorphic to H all of whose edges are colored blue. A formula is presented for the k-Ramsey number of every two stars
The journal of combinatorial mathematics and combinatorial computing | 2014
Eric Andrews; Chira Lumduanhom; Ping Zhang
