Köhler, Ekkehard2021-12-172021-12-1720002197-8085https://depositonce.tu-berlin.de/handle/11303/15946http://dx.doi.org/10.14279/depositonce-14719In this extended abstract we consider structural and algorithmic properties of two graph classes which share the property that they are on the one hand generalizations of permutation graphs, on the other hand subfamilies of AT-free graphs.en510 Mathematikgraphalgorithmasteroidal triple-freeAT-freeminimal separatorAT-free, coAT-free Graphs and AT-free PosetsResearch Paper