Nawarat Ananchuen

Publication Activity (10 Years)

Years Active: 1995-2021
Publications (10 Years): 7

Top Topics

Mutual Reinforcement

Bipartite Graph

Maximum Cardinality

Top Venues

Discuss. Math. Graph Theory

Australas. J Comb.

Appl. Math. Comput.

Publications

Nawarat Ananchuen, Chanun Lewchalermvongs
-minor. Discuss. Math. Graph Theory 41 (2) (2021)
Michael A. Henning, Nawarat Ananchuen, Pawaton Kaemawichanurat
Traceability of connected domination critical graphs. Appl. Math. Comput. 386 (2020)
Nawarat Ananchuen, Pawaton Kaemawichanurat
Connected domination critical graphs with cut vertices. Discuss. Math. Graph Theory 40 (4) (2020)
Nawarat Ananchuen, Watcharintorn Ruksasakchai, Watcharaphong Ananchuen
On independent domination critical graphs and k-factor critical. Ars Comb. 126 (2016)
Pawaton Kaemawichanurat, Lou Caccetta, Nawarat Ananchuen
Critical graphs with respect to total domination and connected domination. Australas. J Comb. 65 (2016)
Nawarat Ananchuen, Watcharaphong Ananchuen, Akira Saito
Extendability of the complementary prism of bipartite graphs. Australas. J Comb. 66 (2016)
Nawarat Ananchuen, Watcharaphong Ananchuen
Some toughness results in independent domination critical graphs. Discuss. Math. Graph Theory 35 (4) (2015)
Watcharaphong Ananchuen, Nawarat Ananchuen, Robert E. L. Aldred
The structure of 4-gamma-critical graphs with a cut vertex. Discret. Math. 310 (17-18) (2010)
Watcharaphong Ananchuen, Nawarat Ananchuen, Louis Caccetta
-Critical. Graphs Comb. 26 (3) (2010)
Nawarat Ananchuen, Watcharaphong Ananchuen, Michael D. Plummer
Matching properties in connected domination critical graphs. Discret. Math. 308 (7) (2008)
Nawarat Ananchuen, Lou Caccetta, Watcharaphong Ananchuen
A characterization of maximal non-k-factor-critical graphs. Discret. Math. 307 (1) (2007)
Nawarat Ananchuen, Michael D. Plummer
Matchings in 3-vertex-critical graphs: The odd case. Discret. Math. 307 (13) (2007)
Nawarat Ananchuen, Michael D. Plummer
3-Factor-criticality in domination critical graphs. Discret. Math. 307 (23) (2007)
Nawarat Ananchuen, Michael D. Plummer
Errata to "Matching properties in domination critical graphs" [Discrete Math 277 (2004) 1-13]. Discret. Math. 306 (2) (2006)
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) (2006)
Nawarat Ananchuen, Michael D. Plummer
Matchings in 3-vertex-critical graphs: The even case. Networks 45 (4) (2005)
Nawarat Ananchuen, Michael D. Plummer
Matching properties in domination critical graphs. Discret. Math. 277 (1-3) (2004)
Nawarat Ananchuen, Michael D. Plummer
Some results related to the toughness of 3-domination critical graphs. Discret. Math. 272 (1) (2003)
Nawarat Ananchuen, Akira Saito
Factor criticality and complete closure of graphs. Discret. Math. 265 (1-3) (2003)
Nawarat Ananchuen, Lou Caccetta
Matching extension and minimum degree. Discret. Math. 170 (1-3) (1997)
Nawarat Ananchuen, Lou Caccetta
A note on k-extendable graphs and independence number. Australas. J Comb. 12 (1995)