Graphs with a prescribed adjacency property. - Watcharaphong Ananchuen; Lou Caccetta (Australas. J Comb., 1992)

On graphs satisfying a strong adacency property. - Watcharaphong Ananchuen; Lou Caccetta (Australas. J Comb., 1993)

On the adjacency properties of paley graphs. - Watcharaphong Ananchuen; Louis Caccetta (Networks, 1993)

On constructing graphs with a prescribed adjacency property. - Watcharaphong Ananchuen; Lou Caccetta (Australas. J Comb., 1994)

On the adjacency properties of generalized Paley graphs. - Watcharaphong Ananchuen (Australas. J Comb., 2001)

A note on constructing digraphs with prescribed properties. - Watcharaphong Ananchuen (Australas. J Comb., 2001)

Cubic and quadruple Paley graphs with the n-e.c. property. - Watcharaphong Ananchuen; Lou Caccetta (Discret. Math., 2006)

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

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

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

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

Domination in Graphs. - Nawarat Ananchuen; Watcharaphong Ananchuen; Michael D. Plummer (Structural Analysis of Complex Networks, 2011)

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

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

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