In this paper, a general framework for enumerating every element in a graph class is given. The main feature of this framework is that it is designed to enumerate only nonisomorphic graphs in a graph class. Applying this framework to the classes of interval graphs and permutation graphs, we give efficient enumeration algorithms for these graph classes such that each element in the class is output in a polynomial time delay. The experimental results are also given. The catalogs of graphs in these graph classes are also provided.

中文翻译：

---

非同构区间图和非同构置换图的枚举

在本文中，给出了枚举图类中每个元素的通用框架。该框架的主要特征是它被设计为仅枚举图类中的非同构图。将此框架应用于间隔图和置换图的类，我们为这些图类提供了有效的枚举算法，以使该类中的每个元素以多项式时间延迟输出。还给出了实验结果。还提供了这些图类中的图目录。