Hell, P.; Kirkpatrick, D. G. On generalized matching problems. (English) Zbl 0454.68077 Inf. Process. Lett. 12, 33-35 (1981). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 15 Documents MSC: 68R10 Graph theory (including graph drawing) in computer science 05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) 68Q25 Analysis of algorithms and problem complexity Keywords:NP-complete problems PDFBibTeX XMLCite \textit{P. Hell} and \textit{D. G. Kirkpatrick}, Inf. Process. Lett. 12, 33--35 (1981; Zbl 0454.68077) Full Text: DOI References: [1] Berge, C., Two theorems in graph theory, Proc. Nat. Acad. Sci. U.S.A., 43, 842-844 (1957) · Zbl 0086.16202 [2] Berge, C., Sur le conplage maximum d’un graphe, C.R. Acad. Sci. Paris, 247, 258-259 (1958) · Zbl 0086.16301 [3] Edmonds, J., Paths, trees and flowers, Canad. J. Math., 17, 449-467 (1965) · Zbl 0132.20903 [4] Edmonds, J.; Johnson, E. L., Matching: a well solved class of integer programs, (Guy, R., Proc. Calgary Internat. Conference on Combinatorial Structures and Their Applications (1970), Gordon and Beach: Gordon and Beach New York), 89-92 [5] Gabow, H. N., An efficient implementation of Edmonds’ algorithm for maximum matching on graphs, J. ACM, 23, 221-234 (1976) · Zbl 0327.05121 [6] P. Hell and D.G. Kirkpatrick, Scheduling, matching, and colouring, in: Algebraic Methods in Graph Theory (Bolyai Janos Math. Society, Budapest) to appear.; P. Hell and D.G. Kirkpatrick, Scheduling, matching, and colouring, in: Algebraic Methods in Graph Theory (Bolyai Janos Math. Society, Budapest) to appear. · Zbl 0474.05054 [7] P. Hell and D.G. Kirkpatrick, to be published.; P. Hell and D.G. Kirkpatrick, to be published. [8] Hopcroft, J. E.; Karp, R. M., An \(n^{52}\) algorithm for maximum matchings in bipartite graphs, SIAM J. Comput., 2, 225-231 (1973) · Zbl 0266.05114 [9] D.S. Johnson, private communication (August 1977).; D.S. Johnson, private communication (August 1977). [10] Karp, R. M., On the complexity of combinatorial problems, Networks, 5, 45-68 (1974) · Zbl 0324.05003 [11] Kirkpatrick, D. G.; Hell, P., On the completeness of a generalized matching problem, Proc. Tenth Annual ACM Symposium on Th. of Computing, 240-245 (1978), San Diego · Zbl 1282.68182 [12] Mühlbacher, J., F-factors of graphs: a generalized matching problem, Information Processing Lett., 8, 4, 207-214 (1979) · Zbl 0426.05043 [13] Mühlbacher, J.; Steinparz, F., Canonical F-factors of graphs, (Pape, U., Discrete Structures and Algorithms (1980), Henser), 93-104, Proc.5th Conference on Graph Theoretic Concepts in Computer Science [14] Mühlbacher, J.; Steinparz, F.; Tinhofer, G., Families of F-factors of graphs, (SYSPRO Report 14⧸80 (1980), Informatik Systemprogrammierung, Universität Linz: Informatik Systemprogrammierung, Universität Linz Austria) · Zbl 0545.90099 [15] Tutte, W. T., The factorization of linear graphs, J. London Math. Soc., 22, 107-111 (1947) · Zbl 0029.23301 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.