CU Logo
Department of
Mathematics and Computer Science

Main Menu

Chariya Uiyyasathian

Associate Professor

Contact

Office:

MATH 1309/20

Phone:

02-218-7134

Email:

Chariya.U@chula.ac.th

Visit Personal's Website

Research Area

Education

  • 1996 B.Sc. (Mathematics) Chulalongkorn University, Thailand
  • 1998 M.S. (Mathematics) University of Illinois at Urbana-Champaign, USA
  • 2003 Ph.D. (Applied Mathematics) University of Colorado at Denver, USA

Publications

Publications:
  1. C. Uiyyasathian and N. Punnim, Some Construction of Group Divisible Designs GDD(m,n;1,3),  International Journal of Pure and Applied Mathematics, 104(2015) No.1, 19--28.
  2. T. Wichianpaisarn and C. Uiyyasathian, Graphs with Large  Clique-chromatic Numbers, Discrete Mathematics, Algorithms and Applications, 7(2015) No.4, 1550055 (6 pages).
  3. T. Wichianpaisarn and C. Uiyyasathian, Clique-chromatic Numbers of Line Graphs, Ars Combinatoria, 118(2015), 285--291.
  4. T. Wichianpaisarn and C. Uiyyasathian, More Results on Clique-chromatic Numbers of Graphs with No Long Path, Lecture Notes in Computer Science, 8845(2014), 185--190.
  5. U. Jongthawonwuth, S. I. El-Zanati and C. Uiyyasathian, On Extending the Bose Construction for Triple Systems to Decompositions of Complete Multipartite Graphs into 2-regular Graphs of Odd Order, Australasian Journal of Combinatorics, 59 (2014) No. 3, 378--390.
  6. T. Wichianpaisarn and C. Uiyyasathian, Clique-chromatic Numbers of Claw-free Graphs, East-west Journal of Mathematics, 15(2013) No. 2, 152--157 .
  7. W. Chareonpanitseri, N. Punnim and C. Uiyyasathian, On Non 3-choosable Bipartite Graphs, Lecture Notes in Computer Science,8296(2013), 42--56.
  8. N. Punnim and C. Uiyyasathian, Group Divisible Designs with Two Associate Classes and (l1, l2)=(1,2), Journal of Combinatorial Mathematics and Combinatorial Computing, 82(2012), 117--130.
  9. C. Uiyyasathian and N. Pabhapote, Group Divisible Designs with Two Associate Classes and l2=4, International Journal of Pure and Applied Mathematics, 73(2011) No.3, 289--298.
  10. W. Chareonpanitseri, N. Punnim and C. Uiyyasathian, On (k,t)-choosability of Graphs,  Ars Combinatoria, 99(2011), 321--333.
  11. C. Uiyyasathian and U. Jongthawonwuth, Clique Partitions of Glued Graphs, Journal of Mathematics Research, 2(2010) No.2, 104--111.
  12. W. Pimpasalee and C. Uiyyasathian, Clique Coverings of Glued Graphs at Complete Clones, International Mathematical Forum,5(2010) No.24, 1155--1166.
  13. C. Uiyyasathian and W. Lapchinda, Group Divisible Designs with Two Associate Classes and l2=2, International Journal of Pure and Applied Mathematics, 55(2009) No.4, 561--568.
  14. C. Uiyyasathian and S. Saduakdee, Perfect Glued Graphs at Complete Clones, Journal of Mathematics Research, 1(2009) No.1, 25--30
  15. W. Pimpasalee, W. Hemakul and C. Uiyyasathian, Clique Coverings of Glued Graphs at Clones K2, Proceedings of the 13th Annual Meeting in Mathematics, May 6-7, 2008, Srinakharinwirot University, Bangkok, Thailand (2008), 39--44.
  16. W. Charoenpanitseri, W. Hemakul and C. Uiyyasathian, Total Colorings of Some Classes of Glued Graphs, East-West Journal of Mathematics, 10(2008) No.2, 161--167.
  17. W. Charoenpanitseri, W. Hemakul and C. Uiyyasathian, Total Colorings of Trimmed Graphs, Contributions in General Algebra II byEast-West Journal of Mathematics for ICDMA2008 (2008), 63--70.
  18. T. Wichianpaisarn and C. Uiyyasathian, Clique Coverings of the k-power of Pyramids and Grids, Proceedings of International Conference on Mathematics: Trends and Developments, December 27-30, 2007, Cairo, Egypt (2007) Vol.I, 87--99.
  19. C. Promsakon and C. Uiyyasathian, Edge-chromatic Numbers of Glued Graphs, Thai Journal of Mathematics, 4(2006) No.2, 395-401.
  20. C. Uiyyasathian and W.Hemakul, Planar Glued Graphs, Scientific Research (Section T), 3(5)(2006), 109-118.
  21. C. Promsakon and C. Uiyyasathian, Chromatic Numbers of Glued Graphs, Thai Journal of Mathematics, 4(2006) No.3, 75-81.
  22. C. Uiyyasathian and K. Fraughnaugh, Maximal-clique Partitions of different sizes, Ars Combinatioria, 77(2005), 109-114.

Scopus ®