Internally 4-connected graphs with no {CUBE, V8}-minor. - Ananchuen, Nawarat; Lewchalermvongs, Chanun (Discuss. Math. Graph Theory, 2021)

Traceability of connected domination critical graphs. - Henning, Michael A.; Ananchuen, Nawarat; Kaemawichanurat, Pawaton (Appl. Math. Comput., 2020)

Connected domination critical graphs with cut vertices. - Ananchuen, Nawarat; Kaemawichanurat, Pawaton (Discuss. Math. Graph Theory, 2020)

Critical graphs with respect to total domination and connected domination. - Kaemawichanurat, Pawaton; Caccetta, Lou; Ananchuen, Nawarat (Australas. J Comb., 2016)

Extendability of the complementary prism of bipartite graphs. - Ananchuen, Nawarat; Ananchuen, Watcharaphong; Saito, Akira (Australas. J Comb., 2016)

On independent domination critical graphs and k-factor critical. - Ananchuen, Nawarat; Ruksasakchai, Watcharintorn; Ananchuen, Watcharaphong (Ars Comb., 2016)

Some toughness results in independent domination critical graphs. - Ananchuen, Nawarat; Ananchuen, Watcharaphong (Discuss. Math. Graph Theory, 2015)

Domination in Graphs. - Ananchuen, Nawarat; Ananchuen, Watcharaphong; Plummer, Michael D. (2011)

The structure of 4-gamma-critical graphs with a cut vertex. - Ananchuen, Watcharaphong; Ananchuen, Nawarat; Aldred, Robert E. L. (Discret. Math., 2010)

A Characterization of 3-(gammac, 2)-Critical Claw-Free Graphs Which are not 3-gammac-Critical. - Ananchuen, Watcharaphong; Ananchuen, Nawarat; Caccetta, Louis (Graphs Comb., 2010)

Matching properties in connected domination critical graphs. - Ananchuen, Nawarat; Ananchuen, Watcharaphong; Plummer, Michael D. (Discret. Math., 2008)

A characterization of maximal non-k-factor-critical graphs. - Ananchuen, Nawarat; Caccetta, Lou; Ananchuen, Watcharaphong (Discret. Math., 2007)

Matchings in 3-vertex-critical graphs: The odd case. - Ananchuen, Nawarat; Plummer, Michael D. (Discret. Math., 2007)

3-Factor-criticality in domination critical graphs. - Ananchuen, Nawarat; Plummer, Michael D. (Discret. Math., 2007)

Errata to "Matching properties in domination critical graphs" [Discrete Math 277 (2004) 1-13]. - Ananchuen, Nawarat; Plummer, Michael D. (Discret. Math., 2006)

Erratum to: "Some results related to the toughness of 3-domination critical graphs" [Discrete Math 272 (2003) 5-15]. - Ananchuen, Nawarat; Plummer, Michael D. (Discret. Math., 2006)

Matchings in 3-vertex-critical graphs: The even case. - Ananchuen, Nawarat; Plummer, Michael D. (Networks, 2005)

Matching properties in domination critical graphs. - Ananchuen, Nawarat; Plummer, Michael D. (Discret. Math., 2004)

Factor criticality and complete closure of graphs. - Ananchuen, Nawarat; Saito, Akira (Discret. Math., 2003)

Some results related to the toughness of 3-domination critical graphs. - Ananchuen, Nawarat; Plummer, Michael D. (Discret. Math., 2003)

Matching extension and minimum degree. - Ananchuen, Nawarat; Caccetta, Lou (Discret. Math., 1997)

A note on k-extendable graphs and independence number. - Ananchuen, Nawarat; Caccetta, Lou (Australas. J Comb., 1995)