Gray Codes for AT-Free Orders
From MaRDI portal
Publication:6288079
zbMATH Open1524.05254arXiv1706.06336MaRDI QIDQ6288079FDOQ6288079
Authors: Jou-Ming Chang, Ton Kloks, Hung-Lung Wang 
Publication date: 20 June 2017
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.
Combinatorial aspects of matroids and geometric lattices (05B35) Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75)
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)
