1) strong quasi claw-free graphs
强半无爪图
2) quasi-claw-free graphs
半无爪图
1.
We show some results for vertex pancyclism in quasi-claw-free graphs.
若对图G中任意一对距离为2的点x,y,存在u∈N(x)∩N(y),使得N|u|N|x|∪N|y|,则称G为半无爪图。
2.
A sufficient condition for quasi-claw-free graphs to be pancyclic;
本文证明了如果G是2-连通半无爪图,G不是圈,|V(G)|≥9,G的每个导出子图B满足φ(u,v)且G中不含同构于Z′的导出子图,则G是泛圈图。
3) quasi-claw-free graph
半无爪图
1.
In this paper, the author proves that every triangularly connected quasi-claw-free graph with at least three edges and without any isolated vertex is vertex pancyclic.
证明了无孤立点的边数不小于3的三角连通的半无爪图是点泛圈的。
4) strong K_(l,p)-controlled graph
强K_(l,p)距离无爪图
5) 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-连通无爪图中存在哈密尔顿圈的一个隐度条件
6) 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性
补充资料：强半
过半；大半：去者强半｜浮生满百今强半｜民强半饿死。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条