Claw-free graphs - A survey

被引:168
作者
Faudree, R
Flandrin, E
Ryjacek, Z
机构
[1] MEMPHIS STATE UNIV, DEPT MATH SCI, MEMPHIS, TN 38152 USA
[2] UNIV PARIS 11, LRI, URA 410 CNRS, F-91405 ORSAY, FRANCE
[3] UNIV W BOHEMIA, DEPT MATH, PLZEN, CZECH REPUBLIC
关键词
D O I
10.1016/S0012-365X(96)00045-3
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In this paper we summarize known results on claw-free graphs. The paper is subdivided into the following chapters and sections: 1. Introduction 2. Paths, cycles, hamiltonicity (a) Preliminaries (b) Degree and neighborhood conditions (c) Local connectivity conditions (d) Further forbidden subgraphs (e) Invariants (f) Squares (g) Regular graphs (h) Other hamiltonicity related results and generalizations 3. Matchings and factors 4. Independence, domination, other invariants and extremal problems 5. Algorithmic aspects 6. Miscellaneous 7. Appendix - List of all 2-connected nonhamiltonian claw-free graphs on n less than or equal to 12 vertices.
引用
收藏
页码:87 / 147
页数:61
相关论文
共 198 条
[71]  
FLANDRIN E, 1986, 282 LRI U PAR SUD
[72]  
FLANDRIN E, 1991, 690 LRI U PAR SUD
[73]  
FLANDRIN E, 1991, 693 LRI U PAR SUD
[74]  
FLANDRIN E, 1990, THESIS U PARIS SUD
[75]  
FLANDRIN E, 1985, 208 IRI U PAR SUD
[76]   A STRENGTHENING OF REBEA,BEN LEMMA [J].
FOUQUET, JL .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1993, 59 (01) :35-40
[77]   A NEW SUFFICIENT CONDITION FOR HAMILTONIAN GRAPHS [J].
FRAISSE, P .
JOURNAL OF GRAPH THEORY, 1986, 10 (03) :405-409
[78]   A NOTE ON THE CHARACTERIZATION OF DOMINATION PERFECT GRAPHS [J].
FULMAN, J .
JOURNAL OF GRAPH THEORY, 1993, 17 (01) :47-51
[79]  
GALEANASANCHEZ H, 1992, CLAW FREE M ORIENTED
[80]  
GERNERT D, 1989, ARS COMBINATORIA, V27, P165