Best Monotone Degree Conditions for Graph Properties: A Survey

被引：27

作者：

Bauer, D. ^{[2
]}

Broersma, H. J. ^{[1
]}

van den Heuvel, J. ^{[3
]}

Kahl, N. ^{[4
]}

Nevo, A. ^{[2
]}

Schmeichel, E. ^{[5
]}

Woodall, D. R. ^{[6
]}

Yatauro, M. ^{[7
]}

机构：

[1] Univ Twente, Fac EEMCS, NL-7500 AE Enschede, Netherlands

[2] Stevens Inst Technol, Dept Math Sci, Hoboken, NJ 07030 USA

[3] London Sch Econ, Dept Math, London WC2A 2AE, England

[4] Seton Hall Univ, Dept Math & Comp Sci, S Orange, NJ 07079 USA

[5] San Jose State Univ, Dept Math, San Jose, CA 95192 USA

[6] Univ Nottingham, Sch Math Sci, Nottingham NG7 2RD, England

[7] Penn State Univ, Dept Math, Media, PA 19063 USA

来源：

GRAPHS AND COMBINATORICS | 2015年 / 31卷 / 01期

关键词：

Best monotone degree conditions; Hamiltonicity; Connectivity; Toughness; k-factor; Binding number; HAMILTONIAN DEGREE CONDITIONS; BINDING NUMBER; SUFFICIENT CONDITION; INDEPENDENT SETS; CHROMATIC NUMBER; TOUGH GRAPHS; CONNECTEDNESS; NEIGHBORHOODS;

D O I：

10.1007/s00373-014-1465-6

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We survey sufficient degree conditions, for a variety of graph properties, that are best possible in the same sense that Chvatal's well-known degree condition for hamiltonicity is best possible.

引用

页码：1 / 22

页数：22