1) quasi-claw-free graph
拟无爪图
1.
Fully cycle extendibility of quasi-claw-free graph;
拟无爪图的完全圈可扩性
2.
In this paper,we prove that:if G is a connected quasi-claw-free graph and has even vertices,then G has 1-factor.
拟无爪图是比无爪图更广泛的图类。
2) quasi claw-free graph
拟无爪图
1.
As a generalization of claw-free graphs,the class of quasi claw-free graphs was introduced by Ainouche.
作为无爪图的一种推广,拟无爪图类由Ainouche引入。
3) claw-free graph
无爪图
1.
Hamiltonicity,neighborhood union and square graphs of claw-free graphs;
哈密尔顿性、邻域并和无爪图的平方图(英文)
2.
A note charaterization of the claw-free graphs;
关于无爪图特征的一个注记
3.
An implicit degree condition for Hamiltonian cycles in k-connected claw-free graphs;
k-连通无爪图中存在哈密尔顿圈的一个隐度条件
4) claw-free graphs
无爪图
1.
The edge-number of maximum spanning eulerian subgraphs of claw-free graphs;
无爪图的极大欧拉生成子图边数问题
2.
Circumference in three-connected claw-free graphs;
3-连通无爪图的最长圈
3.
Hamilton problem of 2-connected claw-free graphs;
2-连通无爪图的Hamilton性
5) claw free graph
无爪图
1.
In this paper, we will use the technique of the vertex insertion on l connected ( l=k or k+1,k≥2 ) claw free graphs to provide a unified proof for G to be hamiltonian or 1 hamiltonian, the sufficient conditions are expressed by the inequality concerning ∑ki=0N(Y i) and n(Y) for eac.
本文利用插点方法 ,给出了关于k或 (k + 1)连通 (k≥ 2 )无爪图G是哈密尔顿的或 1哈密尔顿的统一的证明 。
2.
It is supposed that P[u,v] is the longest path of a 2 connected claw free graph G,d P(x β,x α)=︱P[x β,x α]︱-1,(x β<x α),d * P(x α,x β)=︱P[x α,x β]︱-1(x α<x β ).
若P[u ,v]是 2连通无爪图G的最长路 ,设dp(xβ,xα) =︱P[xβ,xα]︱ -1 (xβ
3.
It was proved that if G is a 3 connected claw free graph on n vertices with the minimum degree δ =min{d( x )| x ∈ V(G )｝and δ *=min｛max(d( x ),d( y ))｜ x,y∈V(G) ,d( x,y )=3｝,then the circumference of the graph G is at least min｛ n,3δ *+δ,6δ ｝.
设 Ｇ 为ｎ 阶３连通无爪图，δ＝ ｍｉｎ｛ｄ（ ｘ）｜ ｘ ∈ Ｖ（ Ｇ）｝ ，δ＝ ｍｉｎ｛ ｍａｘ（ｄ（ ｘ） ，ｄ（ ｙ））｜ ｘ ，ｙ∈ Ｖ（ Ｇ） ，ｄ（ ｘ ，ｙ） ＝ ３｝ ，则 Ｃ（ Ｇ） ≥ｍｉｎ｛ ｎ ，３ δ＋ δ，６ δ｝·用反证法，若图 Ｇ 的最长圈不满足结论，利用 Ｇ 的３连通性和无爪性构造矛盾
6) k_(1,3)-free graph
无爪图
1.
A new sufficient condition for Hamiltonicity of K_(1,3)-free graphs;
无爪图是Hamiltonian图的一个充分条件
2.
In this paper,it is proved that let G bc a 2-connected k_(1,3)-free graph of order n,△(G)≥n-4, then G is Hamilton graph.
本文证明了:设G是n阶2-连通无爪图,△(G)≥n-4,则G是Hamilton图。
3.
Where G is a simple connected K_(1,3)-free graph and C_n is a cycle of order n.
本文通过讨论n阶圈C_n的m次幂(n>2m)给出连通无爪图的2m次幂存在m个边不交Hamilton圈的一个充分条件。
补充资料：舞舞爪爪
1.手舞足蹈的样子。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条