加载中…
The -girth-thickness of a graph is the minimum number of planar subgraphs of girth at least whose union is . In this note, we give the -girth-thickness of the line graph of the complete graph when is even. We also give the minimum number of subgraphs of , which are of girth at least and embeddable on the projective plane, whose union is .

生成讲解博客的中文版本

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