×

A simple existence criterion for \((g<f)\)-factors. (English) Zbl 0723.05101

The criterion of Lovász for the existence of a (g,f)-factor when \(g<f\), or when the graph is bipartite is simplified and a simple direct proof, implying an O(\(\sqrt{(g(V))}\cdot | E|)\) algorithm, for these cases is given.

MSC:

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

References:

[1] Anstee, R. P., An algorithmic proof of Tutte’s ƒ-factor theorem, J. Algorithms, 6, 112-131 (1985) · Zbl 0562.05038
[2] Anstee, R. P., Simplified existence theorems for \((g\),ƒ)-factors, Discrete Appl. Math., 27, 29-38 (1990) · Zbl 0735.05060
[3] Berge, C.; Las Vergnas, M., On the existence of subgraphs with degree constraints, Proc. Nederl. Akad. Wettensch., A81, 165-176 (1978) · Zbl 0377.05035
[4] Gabow, H. N., An efficient reduction technique for degree constrained subgraphs and bidirected network flow problems, 15th ACM STOC, 448-456 (1983)
[5] K. Heinrich, P. Hell, D.G. Kirkpatrick, and G. Liu, A simple existence criterion for \((g\) < ƒ)-factors, with applications to \([a,b]\)-factors, SFU Math. Research Report 86-16.; K. Heinrich, P. Hell, D.G. Kirkpatrick, and G. Liu, A simple existence criterion for \((g\) < ƒ)-factors, with applications to \([a,b]\)-factors, SFU Math. Research Report 86-16.
[6] P. Hell and D.G. Kirkpatrick, Factors and flows, UBC Computer Science Tech. Report 86-22.; P. Hell and D.G. Kirkpatrick, Factors and flows, UBC Computer Science Tech. Report 86-22. · Zbl 0764.68118
[7] P. Hell and D.G. Kirkpatrick, Algorithms for degree constrained graph factors of minimum deficiency, submitted to J. Algorithms.; P. Hell and D.G. Kirkpatrick, Algorithms for degree constrained graph factors of minimum deficiency, submitted to J. Algorithms. · Zbl 0764.68118
[8] Hopcroft, J. E.; Karp, R. M., An \(n^{52}\) algorithm for maximum matchings in bipartite graphs, SIAM J. Computing, 2, 225-231 (1973) · Zbl 0266.05114
[9] Kano, M.; Saito, A., \([a,b]\)-factors of graphs, Discrete Math., 47, 113-116 (1983) · Zbl 0526.05047
[10] Las Vergnas, M., An extension of Tutte’s 1-factor theorem, Discrete Math., 23, 241-255 (1978) · Zbl 0404.05048
[11] Lovász, L., Subgraphs with prescribed valencies, J. Combin. Theory, 8, 319-416 (1970) · Zbl 0198.29201
[12] Lovász, L.; Plummer, M. D., Matching Theory, (Ann. Discrete Math., 29 (1986), North-Holland: North-Holland Amsterdam) · Zbl 0618.05001
[13] Thomassen, C., A remark on the factor theorems of Lovász and Tutte, J. Graph Theory, 5, 441-442 (1981) · Zbl 0465.05055
[14] Tutte, W. T., The factorization of linear graphs, J. London Math. Soc., 22, 107-111 (1947) · Zbl 0029.23301
[15] Tutte, W. T., The subgraph problem, Ann. Discrete Math., 3, 289-295 (1978) · Zbl 0377.05034
[16] Tutte, W. T., Graph factors, Combinatorica, 1, 79-97 (1981) · Zbl 0494.05046
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.