1) (X-)traceable graph
(X-)可迹图
2) traceable graph
可迹图
3) X-cyclable graph
X-可圈图
4) X-Y track graphic
X-Y轨迹图形
5) traceable
[英]['treɪsəbl] [美]['tresəbḷ]
可迹
1.
In this paper, the following result is proved: A connected bipartite graph G = (X, Y;E) is traceable if |X|= |Y|= n≥5,and NC2≥n-1.
本文证明了如下结果:设G=(X,Y;E)是连通二部图,|X|=|Y|=n≥5,若NG2≥n-1,则图G是可迹的。
2.
In (this) paper we will prove that every 2-connected quasi-claw-free gragh G with ｜G｜=n and NC≥n-2[]2 is traceable.
对半无爪图证明以下结果:若G为n阶2-连通半元爪图,满足NC≥n2-2,则G是可迹的。
3.
In this paper, we will use the technique of the vertex insertion on l -connected ( l=k-1 or k+1, k≥2 ) graphs to provide a unified proof for G to be traceable or 1-Hamiltonian.
利用插点方法 ,给出了关于 ( k-1 )或 ( k+ 1 ) -连通 ( k≥ 2 )图 G是可迹的或 1 -哈密尔顿的统一证明 。
6) Xgraph
X图
补充资料：不迹
1.不循法度。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条