Narong Punnim

According to our database, Narong Punnim authored at least 21 papers between 2001 and 2014.

Collaborative distances:

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

2014

GDDs with two associate classes and with three groups of sizes 1, n and n.

Wannee Lapchinda, Narong Punnim, Nittiya Pabhapote

Australas. J Comb., 2014

2012

GDDs with Two Associate Classes and with Three Groups of Sizes 1, n, n and λ 1 < λ 2.

Wannee Lapchinda, Narong Punnim, Nittiya Pabhapote

Proceedings of the Computational Geometry and Graphs - Thailand-Japan Joint Conference, 2012

On Non 3-Choosable Bipartite Graphs.

Wongsakorn Charoenpanitseri, Narong Punnim, Chariya Uiyyasathian

Proceedings of the Computational Geometry and Graphs - Thailand-Japan Joint Conference, 2012

2011

Group Divisible Designs with Two Associate Classes and λ2=1.

Nittiya Pabhapote, Narong Punnim

Int. J. Math. Math. Sci., 2011

An Intermediate Value Theorem for the Arboricities.

Avapa Chantasartrassmee, Narong Punnim

Int. J. Math. Math. Sci., 2011

On (k, t)-choosability of graphs.

Wongsakorn Charoenpanitseri, Narong Punnim, Chariya Uiyyasathian

Ars Comb., 2011

2010

Gregarious GDDs with Two Associate Classes.

Saad I. El-Zanati, Narong Punnim, Christopher A. Rodger

Graphs Comb., 2010

Regular Graphs with Maximum Forest Number.

Avapa Chantasartrassmee, Narong Punnim

Proceedings of the Computational Geometry, Graphs and Applications, 2010

2009

The Hamiltonian number of graphs with prescribed connectivity.

Sermsri Thaithae, Narong Punnim

Ars Comb., 2009

2007

Interpolation theorems in jump graphs.

Narong Punnim

Australas. J Comb., 2007

The Hamiltonian Number of Cubic Graphs.

Sermsri Thaithae, Narong Punnim

Proceedings of the Computational Geometry and Graph Theory, 2007

The Forest Number of (<i>n</i>, <i>m</i>)-Graphs.

Avapa Chantasartrassmee, Narong Punnim

Proceedings of the Computational Geometry and Graph Theory, 2007

2006

Constrained switchings in cubic graphs.

Avapa Chantasartrassmee, Narong Punnim

Ars Comb., 2006

Decycling connected regular graphs.

Narong Punnim

Australas. J Comb., 2006

2005

Switchings, realizations, and interpolation theorems for graph parameters.

Narong Punnim

Int. J. Math. Math. Sci., 2005

Decycling regular graphs.

Narong Punnim

Australas. J Comb., 2005

The Decycling Number of Cubic Planar Graphs.

Narong Punnim

Proceedings of the Discrete Geometry, 2005

2003

The Decycling Number of Cubic Graphs.

Narong Punnim

Proceedings of the Combinatorial Geometry and Graph Theory, 2003

2002

The Clique Numbers of Regular Graphs.

Narong Punnim

Graphs Comb., 2002

Degree Sequences and Chromatic Numbers of Graphs.

Narong Punnim

Graphs Comb., 2002

2001

On the cyclic decomposition of complete graphs into bipartite graphs.

Saad I. El-Zanati, Charles Vanden Eynden, Narong Punnim

Australas. J Comb., 2001