It is known that testing isomorphism of chordal graphs is as hard as the general graph isomorphism problem. Every chordal graph can be represented as the intersection graph of some subtrees of a tree. The leafage of a chordal graph, is defined to be the minimum number of leaves in the representing tree. We construct a fixed-parameter tractable algorithm testing isomorphism of chordal graphs with bounded leafage. The key point is a fixed-parameter tractable algorithm finding the automorphism group of a colored order-3 hypergraph with bounded sizes of color classes of vertices.

中文翻译：

---

测试有界叶子的弦图的同构性是固定参数易处理的

众所周知，测试弦图的同构与一般的图同构问题一样困难。每个和弦图都可以表示为一棵树的某些子树的交集图。弦图的叶子数被定义为表示树中的最小叶子数。我们构建了一个固定参数易处理算法，用于测试具有有界叶数的弦图的同构性。关键点是一个固定参数的易处理算法，它找到了顶点颜色类别大小有界的彩色 3 阶超图的自同构群。