edge connected graph 边连通图
maximally edge-connected graph 极大边连通图
critically -edge-connected graph 临界3棱连通图
minimal n-edge connected graph 极小n棱连通图
critically 3-edge-connected graph 临界棱连通图
k-edge-connected directed graph k边连通有向图
G is called a super restricted edge connected graph if every minimum restricted edge cut separates exactly one edge.
一个图是超级限制边连通的，如果它的任一极小限制边割都孤立一条有最小边度的边。
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可收缩边。
In the cycle packing problem, given an undirected connected graph g, it is required to find the maximum number of pairwise edge disjoint cycles in g.
给定一个无向连通图g，圈包装问题就是求g的边不相交圈的最大数目。
应用推荐