Maximal-clique Partitions of Different Sizes. - Chariya Uiyyasathian; Kathryn Fraughnaugh (Ars Comb., 2005)

On (k, t)-choosability of graphs. - Wongsakorn Charoenpanitseri; Narong Punnim; Chariya Uiyyasathian (Ars Comb., 2011)

On Non 3-Choosable Bipartite Graphs. - Wongsakorn Charoenpanitseri; Narong Punnim; Chariya Uiyyasathian (TJJCCGG, 2012)

More Results on Clique-chromatic Numbers of Graphs with No Long Path. - Tanawat Wichianpaisarn; Chariya Uiyyasathian (JCDCGG, 2013)

On extending the Bose construction for triple systems to decompositions of complete multipartite graphs into 2-regular graphs of odd order. - Uthoomporn Jongthawonwuth; Saad I. El-Zanati; Chariya Uiyyasathian (Australas. J Comb., 2014)

Clique-chromatic Numbers of Line Graphs. - Tanawat Wichianpaisarn; Chariya Uiyyasathian (Ars Comb., 2015)

Graphs with large clique-chromatic numbers. - Tanawat Wichianpaisarn; Chariya Uiyyasathian (Discret. Math. Algorithms Appl., 2015)

Group divisible designs GDD(n, n, n, 1; λ1, λ2). - Atthakorn Sakda; Chariya Uiyyasathian (Australas. J Comb., 2017)

On Hamiltonian decompositions of complete 3-uniform hypergraphs. - Chutima Saengchampa; Chariya Uiyyasathian (Discret. Math., 2024)