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 - 高相形形形形组, 彩色类脊椎的界限大小 。