加载中…
We show that a locally finite, connected graph is -locally chordal (that is, its -balls are chordal) if and only if the unique canonical graph-decomposition of displaying its -global structure is into cliques. Our proof relies on a canonical version of Halin’s characterization of chordal locally finite graphs as those that admit a tree-decomposition into cliques: We show that such tree-decompositions can be chosen to be canonical, that is, so that they are invariant under all the graph’s automorphisms.

生成讲解博客的中文版本

生成AI智能校验的中文版本