Gray Codes for AT-Free Orders

Jou Ming Chang Ton Kloks, Hung Lung Wang*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


at-free graphs are characterized by vertex elimination orders- We show that these at-free orders of a graph can be gen- erated in constant amortized time.

Original languageEnglish
Pages (from-to)273-284
Number of pages12
JournalArs Combinatoria
Publication statusPublished - 2021 Jan

ASJC Scopus subject areas

  • General Mathematics


Dive into the research topics of 'Gray Codes for AT-Free Orders'. Together they form a unique fingerprint.

Cite this