Browsing DSpace

Browsing by Author Punnim N.

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
ก ข ฃ ค ฅ ฆ ง จ ฉ ช ซ ฌ ญ ฎ ฏ ฐ ฑ ฒ ณ ด ต ถ ท ธ น บ ป ผ ฝ พ ฟ ภ ม ย ร ฤ ล ฦ ว ศ ษ ส ห ฬ อ ฮ
or enter first few letters:

Showing results 5 to 24 of 24 < previous

Issue Date	Title	Author(s)
2014	GDDs with two associate classes and with three groups of sizes 1, n and n	Lapchinda W.; Punnim N.; Pabhapote N.
2013	GDDs with two associate classes and with three groups of sizes 1, n, n and λ1 < λ2	Lapchinda W.; Punnim N.; Pabhapote N.
2010	Gregarious GDDs with Two Associate Classes	El-Zanati S.I.; Punnim N.; Rodger C.A.
2011	Group divisible designs with two associate classes and λ2 =1	Pabhapote N.; Punnim N.
2012	Group divisible designs with two association classes	Chaiyasena A.; Hurd S.P.; Punnim N.; Sarvate D.G.
2007	Interpolation theorems in jump graphs	Punnim N.
2011	Loop designs	Hurd S.P.; Sarvate D.G.; Punnim N.
2011	On (k, t)-choosability of graphs	Charoenpanitseri W.; Punnim N.; Uiyyasathian C.
2013	On non 3-choosable bipartite graphs	Charoenpanitseri W.; Punnim N.; Uiyyasathian C.
2001	On the cyclic decomposition of complete graphs into bipartite graphs	Ei-Zanati S.I.; Vanden Eynden C.; Punnim N.
2011	Regular graphs with maximum forest number	Chantasartrassmee A.; Punnim N.
2015	Some construction of group divisible designs GDD(m,n; 1, 3)	Uiyyasathian C.; Punnim N.
2005	Switchings, realizations, and interpolation theorems for graph parameters	Punnim N.
2002	The clique numbers of regular graphs	Punnim N.
2005	The decycling number of cubic graphs	Punnim N.
2007	The Decycling Number of Cubic Planar Graphs	Punnim N.
2008	The forest number of (n,m)-Graphs	Chantasartrassmee A.; Punnim N.
2008	The hamiltonian number of cubic graphs	Thaithae S.; Punnim N.
2009	The Hamiltonian number of graphs with prescribed connectivity	Thaithae S.; Punnim N.
2012	The positivity problem for fourth order linear recurrence sequences is decidable	Tangsupphathawat P.; Punnim N.; Laohakosol V.

Showing results 5 to 24 of 24 < previous