Quasi-claw-free graphs

被引：31

作者：

Ainouche, A ^{[1
]}

机构：

[1] UAG Ceregmia, F-97275 Schoelcher, France

来源：

DISCRETE MATHEMATICS | 1998年 / 179卷 / 1-3期

关键词：

Hamiltonian cycle; Hamiltonian path; claw-free graphs; matching;

D O I：

10.1016/S0012-365X(97)00023-X

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

A graph G is quasi claw;free if it satisfies the property: d(x,y)=2 double right arrow there exists u is an element of N(x)boolean AND N(y) such that N[u]subset of or equal to N[x]boolean OR N[y]. This property is satisfied if in particular u does not center a claw (induced K-1,K-3) Many known results on claw-free graphs, dealing with matching and hamiltonicity are extended to the larger class of quasi-claw-free graphs.

引用

页码：13 / 26

页数：14

共 20 条

[1]

AINOUCHE A, 1990, ARS COMBINATORIA, V29C, P110

[2] AN IMPROVEMENT OF FRAISSE SUFFICIENT CONDITION FOR HAMILTONIAN GRAPHS [J].