default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPawaton Kaemawichanurat
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j17]Pawaton Kaemawichanurat, Odile Favaron:
Partial domination and irredundance numbers in graphs. Appl. Math. Comput. 457: 128153 (2023)- [j16]Natawat Klamsakul, Pantaree Thengarnanchai, Mattanaporn Suebtangjai, Pailin Kaewperm, Nuttanon Songsuwan
, Pawaton Kaemawichanurat:
Counting maximal independent sets in some n-gonal cacti. Discret. Appl. Math. 339: 234-280 (2023) - 2022
- [j15]Nuttanon Songsuwan, Dawud Thongtha, Pawaton Kaemawichanurat:
Chasing a Drunk Robber in Many Classes of Graphs. Dyn. Games Appl. 12(4): 1312-1337 (2022) - [j14]Peter Borg, Kurt Fenech, Pawaton Kaemawichanurat:
Isolation of k-cliques II. Discret. Math. 345(7): 112641 (2022) - 2021
- [j13]Michael A. Henning, Pawaton Kaemawichanurat:
Connected domination critical graphs with a block having maximum number of cut vertices. Appl. Math. Comput. 406: 126248 (2021) - [j12]Odile Favaron, Pawaton Kaemawichanurat:
Inequalities between the Kk-isolation number and the independent Kk-isolation number of a graph. Discret. Appl. Math. 289: 93-97 (2021) - 2020
- [j11]Michael A. Henning, Nawarat Ananchuen, Pawaton Kaemawichanurat:
Traceability of connected domination critical graphs. Appl. Math. Comput. 386: 125455 (2020) - [j10]Peter Borg, Pawaton Kaemawichanurat:
Partial domination of maximal outerplanar graphs. Discret. Appl. Math. 283: 306-314 (2020) - [j9]Peter Borg, Kurt Fenech, Pawaton Kaemawichanurat:
Isolation of k-cliques. Discret. Math. 343(7): 111879 (2020) - [j8]Nawarat Ananchuen, Pawaton Kaemawichanurat:
Connected domination critical graphs with cut vertices. Discuss. Math. Graph Theory 40(4): 1035-1055 (2020) - 2019
- [j7]Shin-ichi Tokunaga, Thiradet Jiarasuksakun, Pawaton Kaemawichanurat:
Isolation number of maximal outerplanar graphs. Discret. Appl. Math. 267: 215-218 (2019) - [j6]Pawaton Kaemawichanurat:
Hamiltonicities of double domination critical and stable claw-free graphs. Discuss. Math. Graph Theory 39(3): 673-687 (2019) - [j5]Michael A. Henning, Pawaton Kaemawichanurat:
Semipaired domination in maximal outerplanar graphs. J. Comb. Optim. 38(3): 911-926 (2019) - 2018
- [j4]Pawaton Kaemawichanurat, Thiradet Jiarasuksakun:
Some results on the independence number of connected domination critical graphs. AKCE Int. J. Graphs Comb. 15(2): 190-196 (2018) - [j3]Pawaton Kaemawichanurat, Lou Caccetta:
Hamiltonicity of Connected Domination Critical Graphs. Ars Comb. 136: 127-151 (2018) - [j2]Michael A. Henning, Pawaton Kaemawichanurat:
Semipaired Domination in Claw-Free Cubic Graphs. Graphs Comb. 34(4): 819-844 (2018) - 2016
- [j1]Pawaton Kaemawichanurat, Lou Caccetta, Nawarat Ananchuen:
Critical graphs with respect to total domination and connected domination. Australas. J Comb. 65: 1-13 (2016)
Informal and Other Publications
- 2018
- [i1]Peter Borg, Kurt Fenech, Pawaton Kaemawichanurat:
Isolation of k-cliques. CoRR abs/1812.11098 (2018)
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-10-07 22:12 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:
