1) contractible cycle
可收缩圈
1.
It is Thomassen who firstly asked if there is a polynomial bounded algorithm for finding a shortest contractible cycle,a shortest separating cycle and a shortest two sided cycle in an embedded graphs.
对于一般曲面上嵌入图,只要它的面宽度充分大,那么同样有多项式算法发现最短可收缩圈。
2) noncontractible cycle
不可收缩圈
1.
This paper investigated the cycle base structures of 2-connected outerplanar graphs on the torus and proved that there is a one-to-one correspondence between the minimal cycle base and two nonhomotopic noncontractible cycles with the shortest total length when fw(G)≥2 and ew(G) > m, m = max{li | 1≤i≤f}(l1,…,lf denote the length of all the non-Hamilton facial walks of G).
研究环面上2-连通外可平面图G在嵌入Π的面宽fw(G)≥2时的圈基理论;给出在面宽fw(G)≥2和边宽ew(G)>m,m=max{li|1≤i≤f}时外可平面图G的最小圈基的结构,其中f记为Π的除Hamilton圈外的面迹数,l1,…,lf,为Π的对应面迹的长;并证明了G的最小圈基与其不同伦的两条长度之和最短的不可收缩圈之间存在一一对应。
2.
The results show that the minimum cycle bases on the plane relates to its facial cycles;otherwise,that on the projective plane not only relate to its facial cycles,but also has a one-one correspondence with its noncontractible cycles.
结果表明,平面上的最小圈基仅与面圈有关,射影平面上的最小圈基不仅与面圈有关,还与其不可收缩圈有着一一对应性。
3.
Then we show that there is a one-one correspondence between minimum cycle bases and the shortest noncontractible cycles.
研究了射影平面上2 连通图的圈基结构,并给出了在嵌入的边宽度ew(G)≥5时外可平面图的最小圈基结构,证明了最小圈基与最短不可收缩圈之间的一一对应性。
3) noncontractible (leaf) cycle
不可收缩(叶)圈
4) contractible edge
可收缩边
1.
The existence theorem of contractible edges in h-connected graphs;
h-连通图中可收缩边的存在定理
2.
The contractible edges of the longest cycle in some 5-connected graphs;
某些5-连通图中最长圈上的可收缩边
3.
Kriesell conjectured that every K, connected graph has a k-contractible edge if the degree sum of any two adjacent vertices is at least 2 5k/4- 1.
Kriesell(2001年)猜想:如果k连通图中任意两个相邻顶点的度的和至少是25k/4-1,则图中有k-可收缩边。
5) tubing,shrinkable
可收缩管
补充资料：收缩中(晚）期喀喇音-收缩晚期杂音综合征
收缩中(晚）期喀喇音-收缩晚期杂音综合征
即"二尖瓣脱垂-喀喇音综合征"。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条