# Gray Codes for AT-Free Orders

## TL;DR

This paper presents a method to generate AT-free vertex orders in graphs efficiently, enabling faster algorithms for processing such graphs.

## Contribution

It introduces a novel algorithm that produces AT-free orders in constant amortized time, improving upon previous methods.

## Key findings

- AT-free orders can be generated in constant amortized time
- The method improves efficiency for processing AT-free graphs
- Potential applications in graph algorithms and optimization

## 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.