Gray Codes for AT-Free Orders
arXiv:1706.06336
Abstract
AT-free graphs are characterized by vertex elimination orders. We show that these AT-free orders of a graph can be generated in constant amortized time.
9 pages, 1 figures. A preliminary version appeared in the Proceedings of the International Workshop on Combinatorial Algorithms (IWOCA 2015) pp. 77-87