×

Degree conditions for graphs to be fractional \((a, b, n)\)-critical graphs. (English) Zbl 1126.05041

Summary: Let \(G\) be a graph, and \(a\) and \(b\) be integers with \(a\leq b\). The 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 are presented, and the degree conditions are sharp in some sense.

MSC:

05C07 Vertex degrees
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] J. A. Bondy and U. R. Murty, Graph Theory with Applications, Macmillan, New York, 1976. · Zbl 1226.05083
[2] M. D. Plummer, On n-extendable graphs, Discrete Math., 1980, 31: 201–210. · Zbl 0442.05060
[3] L. Lovász, On the structure of factorizabl graph, Acta Math. Acad. Sci. Hung., 1972, 23: 179–195. · Zbl 0247.05156
[4] Q. Yu, Characterizations of various matching extension graphs, Australian Journal of Combin., 1993, 7: 55–64. · Zbl 0783.05085
[5] O. Favaron, On k-factor-critical graphs, Discussions Mathematicae–Graph Theory, 1996, 16: 41–51. · Zbl 0865.05061
[6] G. Liu and Q. Yu, k-factors and extendability with prescribed components, Congr. Numer., 1999, 139: 77–88. · Zbl 0961.05057
[7] G. Liu and J. Wang, (a, b, n)-critical graphs, Advance in Mathematics, 1998, 27: 536-540.
[8] K. Heinrich, P. Hell, et al., A simple existence criterion for (g, f)-factors, Discerte Math., 1990, 85: 313–317. · Zbl 0723.05101
[9] K. Ota and T. Tokuda, A degree condition for the existence of regular factors in K 1, n -free graphs, J. Graph Theory, 1996, 22: 59–64. · Zbl 0849.05058
[10] Y. Li and M. Cai, A degree condition for graph to have [a, b]-factor, J. Graph Theory, 1998, 27: 1–6. · Zbl 0891.05057
[11] T. Iida and T. Nishimura, An Ore-type conditions for the existence of k-factors in graphs, Graph and Combintorics, 1991, 7: 353–361. · Zbl 0763.05082
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.