Gavril, Fanica Testing for Equality between Maximum Matching and Minimum Node Covering. (English) Zbl 0367.05056 Inf. Process. Lett. 6, 199-202 (1977). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 9 Documents MSC: 05C99 Graph theory 05-04 Software, source code, etc. for problems pertaining to combinatorics × Cite Format Result Cite Review PDF Full Text: DOI References: [1] Berge, C., The Theory of Graphs and its Applications (1966), John Wiley &Sons: John Wiley &Sons New York, London · Zbl 0187.21303 [2] Edmonds, J., Paths, trees and flowers, Canad. J. Math., 17, 449-467 (1965) · Zbl 0132.20903 [3] Even, S.; Kariv, O., An \(O(n^{2.5})\) algorithm for maximum matching in general graphs, \(16^{th}\) Annual Symposium on Foundations of Computer Science, 100-112 (1975) [4] Harary, F., Graph Theory (1969), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 0797.05064 [5] König, D., Graphen und Matrizen, Mat. Fiz. Lapok, 38, 116-119 (1931) · JFM 57.1340.04 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.