default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKeaitsuda Nakprasit
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]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)- 2023
- [j14]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) - 2022
- [j13]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) - 2021
- [j12]Nuttapong Arunrat, Keaitsuda Maneeruk Nakprasit, Kamsing Nonlaopon, Jessada Tariboon, Sotiris K. Ntouyas:
On Fejér Type Inequalities via (p, q)-Calculus. Symmetry 13(6): 953 (2021) - 2020
- [j11]Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit:
A Generalization of Some Results on List Coloring and DP-Coloring. Graphs Comb. 36(4): 1189-1201 (2020) - [j10]Nuttapong Arunrat, Keaitsuda Maneeruk Nakprasit:
Inequalities for the Derivative of Rational Functions with Prescribed Poles. Int. J. Math. Math. Sci. 2020: 4378409:1-4378409:7 (2020)
2010 – 2019
- 2018
- [j9]Wannapol Pimpasalee, Keaitsuda Maneeruk Nakprasit:
On list backbone coloring of graphs. Ars Comb. 140: 123-134 (2018) - [j8]Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit:
The Game Coloring Number of Planar Graphs with a Specific Girth. Graphs Comb. 34(2): 349-354 (2018) - [j7]Jiraphorn Somsuwan, Keaitsuda Maneeruk Nakprasit:
Some Bounds for the Polar Derivative of a Polynomial. Int. J. Math. Math. Sci. 2018 (2018) - 2017
- [j6]Keaitsuda Maneeruk Nakprasit, Kittikorn Nakprasit:
The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs. Inf. Process. Lett. 117: 40-44 (2017) - 2016
- [j5]Wannapol Pimpasalee, Keaitsuda Maneeruk Nakprasit:
List backbone coloring of paths and cycles. Australas. J Comb. 66: 378-392 (2016) - 2015
- [j4]Keaitsuda Nakprasit, Kittikorn Nakprasit:
The strong chromatic index of graphs with restricted Ore-degrees. Ars Comb. 118: 373-380 (2015) - [j3]Jiraphorn Somsuwan, Keaitsuda Maneeruk Nakprasit:
Analytic Solutions of a Second-Order Functional Differential Equation with a State Derivative Dependent Delay. Int. J. Math. Math. Sci. 2015: 904679:1-904679:8 (2015) - 2014
- [j2]Keaitsuda Nakprasit, Kittikorn Nakprasit:
The strong chromatic index of graphs and subdivisions. Discret. Math. 317: 75-78 (2014) - 2012
- [j1]Keaitsuda Nakprasit, Kittikorn Nakprasit:
Equitable colorings of planar graphs without short cycles. Theor. Comput. Sci. 465: 21-27 (2012)
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 2025-01-09 13:11 CET 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:
