关于完全森林的注记
Note on Perfect Forests
摘要:
图$G$的生成子图$F$称为完美图,如果$F$是一个森林,$F$中每个顶点$x$的度$d_F(x)$是奇数,并且$F$的每个树是$G$的导出子图.我们提供A.D. Scott(Graphs & Combin.,2001):连通图$G$包含完美森林当且仅当$G$有偶数个顶点。
英文摘要:
A spanning subgraph $F$ of a graph $G$ is called perfect if $F$ is a forest, the degree $d_F(x)$ of each vertex $x$ in $F$ is odd, and each tree of $F$ is an induced subgraph of $G$. We provide a short proof of the following theorem of A.D. Scott (Graphs & Combin., 2001): a connected graph $G$ contains a perfect forest if and only if $G$ has an even number of vertices.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。