Nawarat Ananchuen

22 papers Journal 21

Year	Rank	Type	Title / Venue / Authors
2021	J	`jnl`	Internally 4-connected graphs with no Discuss. Math. Graph Theory Nawarat Ananchuen, Chanun Lewchalermvongs
2020	J	`jnl`	Connected domination critical graphs with cut vertices. Discuss. Math. Graph Theory Nawarat Ananchuen, Pawaton Kaemawichanurat
2020	J	`jnl`	Traceability of connected domination critical graphs. Appl. Math. Comput. Michael A. Henning, Nawarat Ananchuen, Pawaton Kaemawichanurat
2016	J	`jnl`	Critical graphs with respect to total domination and connected domination. Australas. J Comb. Pawaton Kaemawichanurat, Lou Caccetta, Nawarat Ananchuen
2016	J	`jnl`	Extendability of the complementary prism of bipartite graphs. Australas. J Comb. Nawarat Ananchuen, Watcharaphong Ananchuen, Akira Saito
2016	J	`jnl`	On independent domination critical graphs and k-factor critical. Ars Comb. Nawarat Ananchuen, Watcharintorn Ruksasakchai, Watcharaphong Ananchuen
2015	J	`jnl`	Some toughness results in independent domination critical graphs. Discuss. Math. Graph Theory Nawarat Ananchuen, Watcharaphong Ananchuen
2011	—	`ch.`	Domination in Graphs. Structural Analysis of Complex Networks Nawarat Ananchuen, Watcharaphong Ananchuen, Michael D. Plummer
2010	J	`jnl`	A Characterization of 3-( Graphs Comb. Watcharaphong Ananchuen, Nawarat Ananchuen, Louis Caccetta
2010	J	`jnl`	The structure of 4-gamma-critical graphs with a cut vertex. Discret. Math. Watcharaphong Ananchuen, Nawarat Ananchuen, Robert E. L. Aldred
2008	J	`jnl`	Matching properties in connected domination critical graphs. Discret. Math. Nawarat Ananchuen, Watcharaphong Ananchuen, Michael D. Plummer
2007	J	`jnl`	3-Factor-criticality in domination critical graphs. Discret. Math. Nawarat Ananchuen, Michael D. Plummer
2007	J	`jnl`	A characterization of maximal non-k-factor-critical graphs. Discret. Math. Nawarat Ananchuen, Lou Caccetta, Watcharaphong Ananchuen
2007	J	`jnl`	Matchings in 3-vertex-critical graphs: The odd case. Discret. Math. Nawarat Ananchuen, Michael D. Plummer
2006	J	`jnl`	Errata to "Matching properties in domination critical graphs" [Discrete Math 277 (2004) 1-13]. Discret. Math. Nawarat Ananchuen, Michael D. Plummer
2006	J	`jnl`	Erratum to: "Some results related to the toughness of 3-domination critical graphs" [Discrete Math 272 (2003) 5-15]. Discret. Math. Nawarat Ananchuen, Michael D. Plummer
2005	J	`jnl`	Matchings in 3-vertex-critical graphs: The even case. Networks Nawarat Ananchuen, Michael D. Plummer
2004	J	`jnl`	Matching properties in domination critical graphs. Discret. Math. Nawarat Ananchuen, Michael D. Plummer
2003	J	`jnl`	Factor criticality and complete closure of graphs. Discret. Math. Nawarat Ananchuen, Akira Saito
2003	J	`jnl`	Some results related to the toughness of 3-domination critical graphs. Discret. Math. Nawarat Ananchuen, Michael D. Plummer
1997	J	`jnl`	Matching extension and minimum degree. Discret. Math. Nawarat Ananchuen, Lou Caccetta
1995	J	`jnl`	A note on k-extendable graphs and independence number. Australas. J Comb. Nawarat Ananchuen, Lou Caccetta