default search action
Nawarat Ananchuen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j21]Nawarat Ananchuen, Chanun Lewchalermvongs:
Internally 4-connected graphs with no {CUBE, V8}-minor. Discuss. Math. Graph Theory 41(2): 481-501 (2021) - 2020
- [j20]Michael A. Henning, Nawarat Ananchuen, Pawaton Kaemawichanurat:
Traceability of connected domination critical graphs. Appl. Math. Comput. 386: 125455 (2020) - [j19]Nawarat Ananchuen, Pawaton Kaemawichanurat:
Connected domination critical graphs with cut vertices. Discuss. Math. Graph Theory 40(4): 1035-1055 (2020)
2010 – 2019
- 2016
- [j18]Pawaton Kaemawichanurat, Lou Caccetta, Nawarat Ananchuen:
Critical graphs with respect to total domination and connected domination. Australas. J Comb. 65: 1-13 (2016) - [j17]Nawarat Ananchuen, Watcharaphong Ananchuen, Akira Saito:
Extendability of the complementary prism of bipartite graphs. Australas. J Comb. 66: 436-448 (2016) - [j16]Nawarat Ananchuen, Watcharintorn Ruksasakchai, Watcharaphong Ananchuen:
On independent domination critical graphs and k-factor critical. Ars Comb. 126: 109-115 (2016) - 2015
- [j15]Nawarat Ananchuen, Watcharaphong Ananchuen:
Some toughness results in independent domination critical graphs. Discuss. Math. Graph Theory 35(4): 703-713 (2015) - 2011
- [p1]Nawarat Ananchuen, Watcharaphong Ananchuen, Michael D. Plummer:
Domination in Graphs. Structural Analysis of Complex Networks 2011: 73-104 - 2010
- [j14]Watcharaphong Ananchuen, Nawarat Ananchuen, Robert E. L. Aldred:
The structure of 4-gamma-critical graphs with a cut vertex. Discret. Math. 310(17-18): 2404-2414 (2010) - [j13]Watcharaphong Ananchuen, Nawarat Ananchuen, Louis Caccetta:
A Characterization of 3-(gammac, 2)-Critical Claw-Free Graphs Which are not 3-gammac-Critical. Graphs Comb. 26(3): 315-328 (2010)
2000 – 2009
- 2008
- [j12]Nawarat Ananchuen, Watcharaphong Ananchuen, Michael D. Plummer:
Matching properties in connected domination critical graphs. Discret. Math. 308(7): 1260-1267 (2008) - 2007
- [j11]Nawarat Ananchuen, Lou Caccetta, Watcharaphong Ananchuen:
A characterization of maximal non-k-factor-critical graphs. Discret. Math. 307(1): 108-114 (2007) - [j10]Nawarat Ananchuen, Michael D. Plummer:
Matchings in 3-vertex-critical graphs: The odd case. Discret. Math. 307(13): 1651-1658 (2007) - [j9]Nawarat Ananchuen, Michael D. Plummer:
3-Factor-criticality in domination critical graphs. Discret. Math. 307(23): 3006-3015 (2007) - 2006
- [j8]Nawarat Ananchuen, Michael D. Plummer:
Errata to "Matching properties in domination critical graphs" [Discrete Math 277 (2004) 1-13]. Discret. Math. 306(2): 291 (2006) - [j7]Nawarat Ananchuen, Michael D. Plummer:
Erratum to: "Some results related to the toughness of 3-domination critical graphs" [Discrete Math 272 (2003) 5-15]. Discret. Math. 306(2): 292 (2006) - 2005
- [j6]Nawarat Ananchuen, Michael D. Plummer:
Matchings in 3-vertex-critical graphs: The even case. Networks 45(4): 210-213 (2005) - 2004
- [j5]Nawarat Ananchuen, Michael D. Plummer:
Matching properties in domination critical graphs. Discret. Math. 277(1-3): 1-13 (2004) - 2003
- [j4]Nawarat Ananchuen, Akira Saito:
Factor criticality and complete closure of graphs. Discret. Math. 265(1-3): 13-21 (2003) - [j3]Nawarat Ananchuen, Michael D. Plummer:
Some results related to the toughness of 3-domination critical graphs. Discret. Math. 272(1): 5-15 (2003)
1990 – 1999
- 1997
- [j2]Nawarat Ananchuen, Lou Caccetta:
Matching extension and minimum degree. Discret. Math. 170(1-3): 1-13 (1997) - 1995
- [j1]Nawarat Ananchuen, Lou Caccetta:
A note on k-extendable graphs and independence number. Australas. J Comb. 12: 59-66 (1995)
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-25 05:49 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: