(a,b,k)-临界图(英)

(a, b, k)-Critical Graphs

设G是一个图且设a，b是非负整数，a＜b．如果消去G的任意K个顶点剩下的图有[a，b]-因子，则称图G是（a，b，k）-临界图，本文给出了一个图是（a，b，k）-临界图的一个充分必要条件，讨论了该条件的一些应用，研究了（a，b，k）-临界图的性质。

Let G be a graph and let a, b be nonegative integers with a ≤b. Then graph G iscalled an (a, b, k)-critical graph if after deleting any k vertices of G the remaining graph of G has an[a, b]-factor. In this paper a necessary and sufficient condition for a graph to be (a, b, k)-critical isgiven. Some applications of this condition are discussed. Therefore the properties of (a, b, k)-criticalgraph are studied.