Powers of Asteroidal Triple-free Graphs with Applications
Jou-Ming Chang, Chin-Wen Ho, and Ming-Tat Ko
Ars Combinatoria, Vol. 67, (2003) pp. 161-173.

The above article has been cited by the articles listed below.
  1. Lap Chi Lau, Derek G. Corneil, Recognizing powers of proper interval, split, and chordal graphs, SIAM Journal on Discrete Mathematics 18 (2004) 83-102. (*)

  2. Jou-Ming Chang, An-Hang Chen, A sufficient condition for quasi-claw-free hamiltonian graphs, Ars Combinatoria 78 (2006) 15-22. (*)

  3. Andreas Brandstädt, Feodor F. Dragan, Yang Xiang, Chenyu Yan, Generalized powers of graphs and their algorithmic use, Proceedings of 10th Scandinavian Workshop on Algorithm Theory (SWAT 2006) Riga, Latvia, July 6-8, 2006, Lecture Notes in Computer Science Vol. 4059, pp. 423-434. (*)

  4. Andreas Brandstädt, Raffaele Mosca, On distance-3 matchings and induced matchings, Graph Theory, Computational Intelligence and Through, Lecture Notes in Computer Science 5420 (2009) 116-126. (*)

  5. Yota Otachi, Koichi Yamazaki, Approximating the path-distance-width for asteroidal triple-free graphs, Proceedings of LA Symposium 2009.

  6. Andreas Brandstädt, Raffaele Mosca, On distance-3 matchings and induced matchings, Discrete Applied Mathematics 159 (2011) 509-520. (*)

  7. Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki, Approximability of the path-distance-width for AT-free Graphs, Proceedings of 37th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2011) Czech Republic, June 21-24, 2011, Lecture Notes in Computer Science Vol. 6986, pp. 271-282. (*)

  8. Andreas Brandstädt, Arne Leitert, Dieter Rautenbach, Efficient dominating and edge dominating sets for graphs and hypergraphss, Arxiv preprint arXiv:1207.0953v2, 2012.

  9. Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki, Approximating the path-distance-width for AT-free graphs and graphs in related classes, Discrete Applied Mathematics 168 (2014) 69-77. (*)

  10. Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey, Cliques and clubs, Proceedings of 8th International Conference on Algorithms and Complexity (CIAC 2013) Barcelona, Spain, May 22-24, 2013, Lecture Notes in Computer Science Vol. 7878, pp. 276-287.

  11. Derek G. Corneil, Juraj Stacho, Vertex ordering characterizations of graphs of bounded asteroidal number, Journal of Graph Theory 78 (2014) 61-79. (*)

  12. Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Arash Rafiey, Finding clubs in graph classes, Discrete Applied Mathematics 174 (2014) 57-65.

  13. Andreas Brandstädt, Pavel Ficur, Arne Leitert, Martin Milanic, Polynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphs, Information Processing Letters 115 (2015) 256-262. (*)

  14. Akul Rana, Anita Pal, Madhumangal Pal, An efficient algorithm to solve the distance k-domination problem on permutation graphs, Journal of Discrete Mathematical Sciences and Cryptography 19 (2016) 241-255. (*)

  15. Andreas Brandstädt, Efficient domination and efficient edge domination: A brief survey, Proceedings of 4th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2018) Guwahati, India, Feb. 12-17, 2018, Lecture Notes in Computer Science Vol. 10743, pp. 1-14. (*)

  16. T. Bharathi, S. Shiny Paulin, Bijan Davvaz. A novel discussion on power fuzzy graphs and their application in decision making, Journal of Applied Mathematics and Informatics 42(1) (2024) 123-137. (*)

  17. T. Bharathi, S. Shiny Paulin, M. Jeba Sherlin, On regular power fuzzy graphs, Journal of Applied Mathematics, Statistics and Informatics 20(2) (2024) 5-18. (*)

Times cited: 13 (from Web of Science)