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

Some results on the independence number of connected domination critical graphs. - Pawaton Kaemawichanurat; Thiradet Jiarasuksakun (AKCE Int. J. Graphs Comb., 2018)

Hamiltonicity of Connected Domination Critical Graphs. - Pawaton Kaemawichanurat; Lou Caccetta (Ars Comb., 2018)

Semipaired Domination in Claw-Free Cubic Graphs. - Michael A. Henning; Pawaton Kaemawichanurat (Graphs Comb., 2018)

Isolation number of maximal outerplanar graphs. - Shin-ichi Tokunaga; Thiradet Jiarasuksakun; Pawaton Kaemawichanurat (Discret. Appl. Math., 2019)

Hamiltonicities of double domination critical and stable claw-free graphs. - Pawaton Kaemawichanurat (Discuss. Math. Graph Theory, 2019)

Semipaired domination in maximal outerplanar graphs. - Michael A. Henning; Pawaton Kaemawichanurat (J. Comb. Optim., 2019)

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

Partial domination of maximal outerplanar graphs. - Peter Borg; Pawaton Kaemawichanurat (Discret. Appl. Math., 2020)

Isolation of k-cliques. - Peter Borg; Kurt Fenech; Pawaton Kaemawichanurat (Discret. Math., 2020)

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

Connected domination critical graphs with a block having maximum number of cut vertices. - Michael A. Henning; Pawaton Kaemawichanurat (Appl. Math. Comput., 2021)

Inequalities between the Kk-isolation number and the independent Kk-isolation number of a graph. - Odile Favaron; Pawaton Kaemawichanurat (Discret. Appl. Math., 2021)

Chasing a Drunk Robber in Many Classes of Graphs. - Nuttanon Songsuwan; Dawud Thongtha; Pawaton Kaemawichanurat (Dyn. Games Appl., 2022)

Isolation of k-cliques II. - Peter Borg; Kurt Fenech; Pawaton Kaemawichanurat (Discret. Math., 2022)

Partial domination and irredundance numbers in graphs. - Pawaton Kaemawichanurat; Odile Favaron (Appl. Math. Comput., 2023)

Counting maximal independent sets in some n-gonal cacti. - Natawat Klamsakul; Pantaree Thengarnanchai; Mattanaporn Suebtangjai; Pailin Kaewperm; Nuttanon Songsuwan; Pawaton Kaemawichanurat (Discret. Appl. Math., 2023)

On graphs whose domination number is equal to chromatic and dominator chromatic numbers. - David A. Kalarkop; Pawaton Kaemawichanurat; Raghavachar Rangarajan (RAIRO Oper. Res., 2025)