default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNarong Punnim
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2014
[j14]Wannee Lapchinda, Narong Punnim, Nittiya Pabhapote:
GDDs with two associate classes and with three groups of sizes 1, n and n. Australas. J Comb. 58: 292-303 (2014)- 2011
- [j13]Wongsakorn Charoenpanitseri, Narong Punnim, Chariya Uiyyasathian:
On (k, t)-choosability of graphs. Ars Comb. 99: 321-333 (2011) - [j12]Nittiya Pabhapote, Narong Punnim:
Group Divisible Designs with Two Associate Classes and λ2=1. Int. J. Math. Math. Sci. 2011: 148580:1-148580:10 (2011) - [j11]Avapa Chantasartrassmee, Narong Punnim:
An Intermediate Value Theorem for the Arboricities. Int. J. Math. Math. Sci. 2011: 947151:1-947151:7 (2011) - 2010
- [j10]Saad I. El-Zanati, Narong Punnim, Christopher A. Rodger:
Gregarious GDDs with Two Associate Classes. Graphs Comb. 26(6): 775-780 (2010) - 2009
- [j9]Sermsri Thaithae, Narong Punnim:
The Hamiltonian number of graphs with prescribed connectivity. Ars Comb. 90 (2009) - 2007
- [j8]Narong Punnim:
Interpolation theorems in jump graphs. Australas. J Comb. 39: 103-114 (2007) - 2006
- [j7]Narong Punnim:
Decycling connected regular graphs. Australas. J Comb. 35: 155-170 (2006) - [j6]Avapa Chantasartrassmee, Narong Punnim:
Constrained switchings in cubic graphs. Ars Comb. 81 (2006) - 2005
- [j5]Narong Punnim:
Decycling regular graphs. Australas. J Comb. 32: 147-162 (2005) - [j4]Narong Punnim:
Switchings, realizations, and interpolation theorems for graph parameters. Int. J. Math. Math. Sci. 2005(13): 2095-2117 (2005) - 2002
- [j3]Narong Punnim:
Degree Sequences and Chromatic Numbers of Graphs. Graphs Comb. 18(3): 597-603 (2002) - [j2]Narong Punnim:
The Clique Numbers of Regular Graphs. Graphs Comb. 18(4): 781-785 (2002) - 2001
- [j1]Saad I. El-Zanati, Charles Vanden Eynden, Narong Punnim:
On the cyclic decomposition of complete graphs into bipartite graphs. Australas. J Comb. 24: 209-220 (2001)
Conference and Workshop Papers
- 2012
- [c7]Wongsakorn Charoenpanitseri, Narong Punnim, Chariya Uiyyasathian:
On Non 3-Choosable Bipartite Graphs. TJJCCGG 2012: 42-56 - [c6]Wannee Lapchinda, Narong Punnim, Nittiya Pabhapote:
GDDs with Two Associate Classes and with Three Groups of Sizes 1, n, n and λ 1 < λ 2. TJJCCGG 2012: 101-109 - 2010
- [c5]Avapa Chantasartrassmee, Narong Punnim:
Regular Graphs with Maximum Forest Number. CGGA 2010: 12-18 - 2007
- [c4]Avapa Chantasartrassmee, Narong Punnim:
The Forest Number of (n, m)-Graphs. KyotoCGGT 2007: 33-40 - [c3]Sermsri Thaithae, Narong Punnim:
The Hamiltonian Number of Cubic Graphs. KyotoCGGT 2007: 213-223 - 2005
- [c2]Narong Punnim:
The Decycling Number of Cubic Planar Graphs. CJCDGCGT 2005: 149-161 - 2003
- [c1]Narong Punnim:
The Decycling Number of Cubic Graphs. IJCCGGT 2003: 141-145
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
