Degree conditions for graphs to be fractional (a, b, n)-critical graphs

被引：0
作者：
Li J. [1 ]
Ma Y. [2 ]
机构：
[1] Department of Mathematics, Hunan University of Science and Technology
[2] School of Management, Shandong Normal University
来源：
Journal of Systems Science and Complexity | 2006年 / 19卷 / 4期
关键词：
Fractional; (a; b; n)-critical graph; a; b]-factor;
D O I：
10.1007/s11424-006-0491-8
中图分类号：
学科分类号：
摘要：
Let G be a graph, and a and b be integers with a b. A graph G is called a fractional (a, b, n)-critical graph if after any n vertices of G are deleted the remaining subgraph has a fractional [a, b]-factor. In this paper two degree conditions for graphs to be fractional (a, b, n)-critical graphs are presented, and the degree conditions are sharp in some sense. © Springer Science + Business Media, Inc. 2006.
引用
收藏
页码：491 / 497
页数：6
相关论文
共 11 条
  • [1] Bondy J.A., Murty U.R., Graph Theory with Applications, (1976)
  • [2] Plummer M.D., On n-extendable graphs, Discrete Math., 31, pp. 201-210, (1980)
  • [3] Lovasz L., On the structure of factorizabl graph, Acta Math. Acad. Sci. Hung., 23, pp. 179-195, (1972)
  • [4] Yu Q., Characterizations of various matching extension graphs, Australian Journal of Combin., 7, pp. 55-64, (1993)
  • [5] Favaron O., On k-factor-critical graphs, Discussions Mathematicae-graph Theory, 16, pp. 41-51, (1996)
  • [6] Liu G., Yu Q., K-factors and extendability with prescribed components, Congr. Numer., 139, pp. 77-88, (1999)
  • [7] Liu G., Wang J., (a,b,n)-critical graphs, Advance in Mathematics, 27, pp. 536-540, (1998)
  • [8] Heinrich K., Hell P., Et al., A simple existence criterion for (g, f)-factors, Discerte Math., 85, pp. 313-317, (1990)
  • [9] Ota K., Tokuda T., A degree condition for the existence of regular factors in K <sub>1,n</sub>-free graphs, J. Graph Theory, 22, pp. 59-64, (1996)
  • [10] Li Y., Cai M., A degree condition for graph to have [a, b]-factor, J. Graph Theory, 27, pp. 1-6, (1998)
12