An edge of a 6 connected graph is said to be 6-contractible if its contraction results still in a 6 connected graph.
如果6连通图的一条边收缩后使得所得到的图仍是6连通,则这条边称为6可收缩边。
2
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.