×

A sufficient condition for a graph to have \([a,b]\)-factors. (English) Zbl 0746.05051

Summary: We give a sufficient condition by using neighborhoods for a graph to have \([a,b]\)-factors.

MSC:

05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Akiyama, J., Kano, M.: Factors and factorizations of graphs – A survey. J. Graph Theory9, 1–42 (1985) · Zbl 0587.05048 · doi:10.1002/jgt.3190090103
[2] Amahashi, A., Kano, M.: Factors with given components. Ann. Discrete Math.42, 1–6 (1982) · Zbl 0525.05048 · doi:10.1016/0012-365X(82)90048-6
[3] Anderson, I.: Perfect matchings of a graph. J. Combin. Theory (B)10, 183–186 (1971) · Zbl 0172.48904 · doi:10.1016/0095-8956(71)90041-4
[4] Behzad, F., Chartrand, G. and Lesniak-Foster, L.: Graphs and digraphs. Boston: Prindle, Qeber and Schmidt, 1979 · Zbl 0403.05027
[5] Berge, C., Las Vergnas, M.: On the existence of subgraphs with degree constraints. Proc. K. Ned. Acad. Wet. Amsterdam, (A)81, 165–176 (1978). · Zbl 0377.05035
[6] Cui, Y., Kano, M.: Some results on odd factors of graphs. J. Graph Theory,12, 327–333 (1988) · Zbl 0661.05049 · doi:10.1002/jgt.3190120305
[7] Enomoto, H., Ota, K. and Kano, M.: A sufficient condition for a bipartite graph to have ak-factor. J. Graph Theory,12, 141–151 (1988) · Zbl 0718.05044 · doi:10.1002/jgt.3190120115
[8] Lovász, L.: Subgraphs with prescribed valencies. J. Comb. Theory9, 391–416 (1970) · Zbl 0198.29201
[9] Tutte, W.T.: Graph factors. Combinatorica,1, 70–97 (1981) · Zbl 0494.05046 · doi:10.1007/BF02579180
[10] Woodall, D.R.: The binding number of a graph and its Anderson number. J. Comb. Theory (B) 15, 225–255 (1973) · Zbl 0253.05139 · doi:10.1016/0095-8956(73)90038-5
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.