default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKittikorn Nakprasit
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]Wipawee Tangjai, Kittikorn Nakprasit, Keaitsuda Maneeruk Nakprasit, Pongpat Sittitrai:
Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition. Discret. Appl. Math. 342: 347-354 (2024)- [j29]Kittikorn Nakprasit, Pongpat Sittitrai, Wannapol Pimpasalee
:
Planar graphs without 4- and 6-cycles are (3,4)-colorable. Discret. Appl. Math. 356: 44-51 (2024) - 2023
- [j28]Sarawute Sribunhung, Keaitsuda Nakprasit, Kittikorn Nakprasit, Pongpat Sittitrai:
Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without 4-cycles and 7-cycles. Discuss. Math. Graph Theory 43(1): 287-297 (2023) - [j27]Kittikorn Nakprasit, Watcharintorn Ruksasakchai, Pongpat Sittitrai:
Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles. Theor. Comput. Sci. 941: 131-139 (2023) - 2022
- [j26]Pongpat Sittitrai, Kittikorn Nakprasit:
Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate. Discret. Math. 345(9): 112942 (2022) - [j25]Pongpat Sittitrai, Kittikorn Nakprasit:
An analogue of DP-coloring for variable degeneracy and its applications. Discuss. Math. Graph Theory 42(1): 89-99 (2022) - [j24]Janejira Laomala, Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit, Watcharintorn Ruksasakchai:
The Strong Equitable Vertex 1-Arboricity of Complete Bipartite Graphs and Balanced Complete k-Partite Graphs. Symmetry 14(2): 287 (2022) - [c2]Anupong Kanarach, Kittikorn Nakprasit, Banchar Arnonkijpanich:
Estimating the Physical Parameters of Human Arm Motion from Video using Fixed-Point PCA Transform and Nonlinear Least-Squares Method. ICFSP 2022: 86-91 - 2021
- [j23]Pongpat Sittitrai, Kittikorn Nakprasit:
Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate. Discret. Math. 344(11): 112564 (2021) - 2020
- [j22]Runrun Liu, Xiangwen Li, Kittikorn Nakprasit, Pongpat Sittitrai, Gexin Yu:
DP-4-colorability of planar graphs without adjacent cycles of given length. Discret. Appl. Math. 277: 245-251 (2020) - [j21]Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit:
A Generalization of Some Results on List Coloring and DP-Coloring. Graphs Comb. 36(4): 1189-1201 (2020)
2010 – 2019
- 2019
- [j20]Pongpat Sittitrai, Kittikorn Nakprasit:
Sufficient Conditions on Planar Graphs to Have a Relaxed DP-3-Coloring. Graphs Comb. 35(4): 837-845 (2019) - 2018
- [j19]Pongpat Sittitrai, Kittikorn Nakprasit:
Defective 2-colorings of planar graphs without 4-cycles and 5-cycles. Discret. Math. 341(8): 2142-2150 (2018) - [j18]Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit:
The Game Coloring Number of Planar Graphs with a Specific Girth. Graphs Comb. 34(2): 349-354 (2018) - [i1]Pongpat Sittitrai, Kittikorn Nakprasit:
Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable. CoRR abs/1812.10473 (2018) - 2017
- [j17]Patcharapan Jumnongnit, Kittikorn Nakprasit:
Graphs with Bounded Maximum Average Degree and Their Neighbor Sum Distinguishing Total-Choice Numbers. Int. J. Math. Math. Sci. 2017: 5897049:1-5897049:4 (2017) - [j16]Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit:
The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs. Inf. Process. Lett. 117: 40-44 (2017) - 2015
- [j15]Keaitsuda Nakprasit, Kittikorn Nakprasit:
The strong chromatic index of graphs with restricted Ore-degrees. Ars Comb. 118: 373-380 (2015) - 2014
- [j14]Watcharintorn Ruksasakchai, Kittikorn Nakprasit:
(2, t)-choosasble graphs. Ars Comb. 113: 307-319 (2014) - [j13]Keaitsuda Nakprasit, Kittikorn Nakprasit:
The strong chromatic index of graphs and subdivisions. Discret. Math. 317: 75-78 (2014) - 2013
- [j12]Watcharintorn Ruksasakchai, Kittikorn Nakprasit:
On a conjecture about (k, t)-choosability. Ars Comb. 111: 375-387 (2013) - 2012
- [j11]Kittikorn Nakprasit:
Equitable colorings of planar graphs with maximum degree at least nine. Discret. Math. 312(5): 1019-1024 (2012) - [j10]Keaitsuda Nakprasit, Kittikorn Nakprasit:
Equitable colorings of planar graphs without short cycles. Theor. Comput. Sci. 465: 21-27 (2012)
2000 – 2009
- 2008
- [j9]Kittikorn Nakprasit:
A note on the strong chromatic index of bipartite graphs. Discret. Math. 308(16): 3726-3728 (2008) - [j8]Seog-Jin Kim, Kittikorn Nakprasit:
Coloring the complements of intersection graphs of geometric figures. Discret. Math. 308(20): 4589-4594 (2008) - [j7]Béla Bollobás, Alexandr V. Kostochka, Kittikorn Nakprasit:
Packing d-degenerate graphs. J. Comb. Theory B 98(1): 85-94 (2008) - 2006
- [j6]Seog-Jin Kim, Kittikorn Nakprasit, Michael J. Pelsmajer, Jozef Skokan:
Transversal numbers of translates of a convex body. Discret. Math. 306(18): 2166-2173 (2006) - 2005
- [j5]Alexandr V. Kostochka, Kittikorn Nakprasit, Sriram V. Pemmaraju:
On Equitable Coloring of d-Degenerate Graphs. SIAM J. Discret. Math. 19(1): 83-95 (2005) - [j4]Alexandr V. Kostochka, Kittikorn Nakprasit:
On equitable Delta-coloring of graphs with low average degree. Theor. Comput. Sci. 349(1): 82-91 (2005) - 2004
- [j3]Seog-Jin Kim, Alexandr V. Kostochka, Kittikorn Nakprasit:
On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane. Electron. J. Comb. 11(1) (2004) - [j2]Seog-Jin Kim, Kittikorn Nakprasit:
On the Chromatic Number of the Square of the Kneser Graph K(2 k+1, k). Graphs Comb. 20(1): 79-90 (2004) - 2003
- [j1]Alexandr V. Kostochka, Kittikorn Nakprasit:
Equitable Colourings Of D-Degenerate Graphs. Comb. Probab. Comput. 12(1): 53-60 (2003) - [c1]Sriram V. Pemmaraju, Kittikorn Nakprasit, Alexandr V. Kostochka:
Equitable colorings with constant number of colors. SODA 2003: 458-459
Coauthor Index
aka: Keaitsuda Maneeruk Nakprasit
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-08-05 20:23 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:
