Gray Codes for AT-Free Orders

Jou-Ming Chang, Ton Kloks, Hung-Lung Wang

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.