Best Monotone Degree Conditions for Graph Properties: A Survey

被引：0
|
作者：
D. Bauer
H. J. Broersma
J. van den Heuvel
N. Kahl
A. Nevo
E. Schmeichel
D. R. Woodall
M. Yatauro
机构：
[1] Stevens Institute of Technology,Department of Mathematical Sciences
[2] University of Twente,Faculty of EEMCS
[3] London School of Economics,Department of Mathematics
[4] Seton Hall University,Department of Mathematics and Computer Science
[5] San José State University,Department of Mathematics
[6] University of Nottingham,School of Mathematical Sciences
[7] Penn State University,Department of Mathematics
来源：
Graphs and Combinatorics | 2015年 / 31卷
关键词：
Best monotone degree conditions; Hamiltonicity; Connectivity; Toughness; -factor; Binding number ;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We survey sufficient degree conditions, for a variety of graph properties, that are best possible in the same sense that Chvátal’s well-known degree condition for hamiltonicity is best possible.
引用
收藏
页码：1 / 22
页数：21
相关论文
共 50 条
12345