假设有连通图G，e是其中一条边，如果G-e是不连通的，则边e是图G的一条割边。此情形下，G-e必包含两个连通分支。
现代的割边设计并不是满是招摇的快乐谈话和闪亮的广告。
Modern cut-edge design isn't filled with loud happy talk and blinking advertisements.
在修割边和钻孔之间的裂纹用气弧消除，然后进行焊补。
The crack between the coped and hole was removed by air arc and then repaired by welding.
本文不利用收缩方法，直接证明了：当图G至多差一边有两棵边不相交的生成树时，G是超欧拉图或者G有割边。
In this note, no using the contraction method, we prove that if a graph G is one edge short of having two edge-disjoint spanning trees, then G has a cut edge or G is supereulerian.
应用推荐