Nawarat Ananchuen

According to our database, Nawarat Ananchuen authored at least 22 papers between 1995 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2021

Internally 4-connected graphs with no <i>{CUBE, V₈}</i>-minor.

Nawarat Ananchuen, Chanun Lewchalermvongs

Discuss. Math. Graph Theory, 2021

2020

Connected domination critical graphs with cut vertices.

Nawarat Ananchuen, Pawaton Kaemawichanurat

Discuss. Math. Graph Theory, 2020

Traceability of connected domination critical graphs.

Michael A. Henning, Nawarat Ananchuen, Pawaton Kaemawichanurat

Appl. Math. Comput., 2020

2016

On independent domination critical graphs and k-factor critical.

Nawarat Ananchuen, Watcharintorn Ruksasakchai, Watcharaphong Ananchuen

Ars Comb., 2016

Critical graphs with respect to total domination and connected domination.

Pawaton Kaemawichanurat, Lou Caccetta, Nawarat Ananchuen

Australas. J Comb., 2016

Extendability of the complementary prism of bipartite graphs.

Nawarat Ananchuen, Watcharaphong Ananchuen, Akira Saito

Australas. J Comb., 2016

2015

Some toughness results in independent domination critical graphs.

Nawarat Ananchuen, Watcharaphong Ananchuen

Discuss. Math. Graph Theory, 2015

2011

Domination in Graphs.

Nawarat Ananchuen, Watcharaphong Ananchuen, Michael D. Plummer

Proceedings of the Structural Analysis of Complex Networks, 2011

2010

A Characterization of 3-(<i>gamma</i>_<i>c</i>, 2)-Critical Claw-Free Graphs Which are not 3-<i>gamma</i>_<i>c</i>-Critical.

Watcharaphong Ananchuen, Nawarat Ananchuen, Louis Caccetta

Graphs Comb., 2010

The structure of 4-gamma-critical graphs with a cut vertex.

Watcharaphong Ananchuen, Nawarat Ananchuen, Robert E. L. Aldred

Discret. Math., 2010

2008

Matching properties in connected domination critical graphs.

Nawarat Ananchuen, Watcharaphong Ananchuen, Michael D. Plummer

Discret. Math., 2008

2007

3-Factor-criticality in domination critical graphs.

Nawarat Ananchuen, Michael D. Plummer

Discret. Math., 2007

Matchings in 3-vertex-critical graphs: The odd case.

Nawarat Ananchuen, Michael D. Plummer

Discret. Math., 2007

A characterization of maximal non-k-factor-critical graphs.

Nawarat Ananchuen, Lou Caccetta, Watcharaphong Ananchuen

Discret. Math., 2007

2006

Erratum to: "Some results related to the toughness of 3-domination critical graphs" [Discrete Math 272 (2003) 5-15].

Nawarat Ananchuen, Michael D. Plummer

Discret. Math., 2006

Errata to "Matching properties in domination critical graphs" [Discrete Math 277 (2004) 1-13].

Nawarat Ananchuen, Michael D. Plummer

Discret. Math., 2006

2005

Matchings in 3-vertex-critical graphs: The even case.

Nawarat Ananchuen, Michael D. Plummer

Networks, 2005

2004

Matching properties in domination critical graphs.

Nawarat Ananchuen, Michael D. Plummer

Discret. Math., 2004

2003

Factor criticality and complete closure of graphs.

Nawarat Ananchuen, Akira Saito

Discret. Math., 2003

Some results related to the toughness of 3-domination critical graphs.

Nawarat Ananchuen, Michael D. Plummer

Discret. Math., 2003

1997

Matching extension and minimum degree.

Nawarat Ananchuen, Lou Caccetta

Discret. Math., 1997

1995

A note on k-extendable graphs and independence number.

Nawarat Ananchuen, Lou Caccetta

Australas. J Comb., 1995