本文不利用收缩方法,直接证明了:当图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.
图28线割穿线孔能以选定的边为基准按标准距离创建。
Figure 28 Wire Threading hole is created based on normal distance to the selected edge.
为了区别两种割,有时称这种割为顶点割,而另一种叫做边割。
In order to distinguish the two kinds of cuts we sometimes call this a vertex-cut and the other one an edge-cut.
看,一个孤独的高原姑娘,在远远的田野间收割,一边割一边独自歌唱,请你站住。或者俏悄走过!
BEHOLD her, single in the field, Yon solitary Highland Lass! Reaping and singing by herself, Stop here, or gently pass!
看,一个孤独的高原姑娘,在远远的田野间收割,一边割一边独自歌唱,请你站住。或者俏悄走过!
BEHOLD her, single in the field, Yon solitary Highland Lass! Reaping and singing by herself, Stop here, or gently pass!
应用推荐