加载中…
A graph is said to be chordal bipartite if it is bipartite and contains no induced cycle of length at least . It is proved that if does not contain bipartite claw as an induced subgraph, then the Weisfeiler-Leman dimension of is at most . The proof is based on the theory of coherent configurations.

生成讲解博客的中文版本

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