-
N. Ananchuen, M.D. Plummer and W. Ananchuen. Matching Properties in Connected Domination Critical Graphs, Discrete Mathematics, 308(2008), 12601267.
-
N. Ananchuen. On Domination Critical Graphs with Cutvertices having Connected Domination Number 3, International Mathematical Forum, 2(2007), 3041 3052.
-
N. Ananchuen and M.D. Plummer. 3-Factor-criticality in Domination Critical Graphs, Discrete Mathematics, 307(2007), 30063015.
-
N. Ananchuen and Plummer M.D. Matchings in 3vertexcritical graphs: The odd case, Discrete Mathematics, 307 (2007), 1651 1658.
-
N. Ananchuen, L. Caccetta. and W. Ananchuen. A characterization of maximal non-k-factor-critical graphs, Discrete Mathematics, 307 (2007), 108 114.
-
N. Ananchuen and M.D. Plummer. Some Results Related to the Toughness of 3-Domination Critical Graphs II, Utilitas Math., 70 (2006), 1132.
-
N. Ananchuen and M.D. Plummer. On the Connectivity and Matchings in 3-vertex-critical Claw-free Graphs, Utilitas Math., 69(2006), 8596.
-
N. Ananchuen and M.D. Plummer. Matchings in 3-vertex-critical Graphs: The Even Case, Networks, 45 (2005), 210-213.
-
N. Ananchuen and M.D. Plummer. Matching properties in domination critical graphs, Discrete Mathematics, 277 (2004), 1 13.
-
N. Ananchuen and M.D. Plummer. Some results related to the toughness of 3-domination critical graphs, Discrete Mathematics, 272(2003), 5-15.
-
N. Ananchuen and A. Saito. Factor criticality and complete closure of graphs, Discrete Mathematics, 265(2003), 13-21.
-
N. Ananchuen. On a minimum cutset of strongly k-extendable graphs, The Journal of Combinatorial Mathematics and Combinatorial Computing, 45(2003), 63-78.
-
N. Ananchuen. On minimum degree of strongly k-extendable graphs, The Journal of Combinatorial Mathematics and Combinatorial Computing, 38 (2001), 149 159.
-
N. Ananchuen. On strongly k-extendable graphs, The Journal of Combinatorial Mathematics and Combinatorial Computing, 38 (2001), 3-19.
-
N. Ananchuen. On minimally k -extendable graphs, Silpakorn University Journal, 17(1997), 75-89.
-
N. Ananchuen and L. Caccetta. Matching extension and minimum degree, Discrete Mathematics, 170(1997), 1-13.
-
N. Ananchuen and L. Caccetta. On (n - 2)-extendable graphs II, The Journal of Combinatorial Mathematics and Combinatorial Computing, 20 (1996), 65-80.
-
N. Ananchuen and L. Caccetta. A note on k-extendable graphs and independence number, The Australasian Journal of Combinatorics, 12 (1995), 59-65.
-
N. Ananchuen and L. Caccetta. On (n - 2)-extendable graphs,. The Journal of Combinatorial Mathematics and Combinatorial Computing, 16 (1994), 115-128.
-
N. Ananchuen and L. Caccetta. On minimally k-extendable graphs, The Australasian Journal of Combinatorics, 9 (1994), 153-168.
-
N. Ananchuen and L. Caccetta. On strongly edge-critical graphs of given diameter, The Australasian Journal of Combinatorics, 8 (1993), 99-122.
-
N. Ananchuen and L. Caccetta. On critically k-extendable graphs, The Australasian Journal of Combinatorics, 6 (1992), 39-65.
|