Gray Codes for AT-Free Orders
Combinatorics
2021-08-20 v3
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.
Cite
@article{arxiv.1706.06336,
title = {Gray Codes for AT-Free Orders},
author = {Jou-Ming Chang and Ton Kloks and Hung-Lung Wang},
journal= {arXiv preprint arXiv:1706.06336},
year = {2021}
}
Comments
9 pages, 1 figures. A preliminary version appeared in the Proceedings of the International Workshop on Combinatorial Algorithms (IWOCA 2015) pp. 77-87