Gray Codes for AT-Free Orders via Antimatroids
Jou-Ming Chang, Ton Kloks, and Hung-Lung Wang
Proceedings of the 26th International Workshop on Combinatorial Algorithms (IWOCA 2015), Verona, Italy, Oct. 5-7, 2015.
Lecture Notes in Computer Science, Vol. 9538, pp. 77-87.

This paper is cited by
  1. Wing-Kai Hon, Ton Kloks, Hsiang-Hsuan Liu On the P3-convexity of some classes of graphs with few P4s and permutation graphs, Proceedings of the Australasian Computer Science Week Multiconference (ACSW '16) Article No. 24.

  2. Jesse Beisegel, Characterising AT-free Graphs with BFS, Proceedings of 44th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2018) Lecture Notes in Computer Science, vol. 11159, pp. 15-26.

  3. Jean Cardinal, Jean-Paul Doignon, Keno Merckx, Finding a maximum-weight convex set in a chordal graph, Journal of Graph Algorithms and Applications 23 (2019) 167-190.

  4. Jesse Beisegel, Convexity in graphs: vertex order characterisations and graph searching, Doctoral Thesis, Brandenburg University of Technology, March 2020

  5. Ton Kloks, Hung-Lung Wang Gray codes for AT-free orders, Ars Combinatoria 155 (2021) 273-284.