Gray Codes for AT-Free Orders

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

Publication date 20 June 2017

Combinatorial aspects of matroids and geometric lattices (05B35) Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75)

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.

This page was built for publication: Gray Codes for AT-Free Orders

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6288079)