Testing for Equality between Maximum Matching and Minimum Node Covering. (English) Zbl 0367.05056


05C99 Graph theory
05-04 Software, source code, etc. for problems pertaining to combinatorics
Full Text: DOI


[1] Berge, C., The theory of graphs and its applications, (1966), John Wiley &Sons New York, London
[2] Edmonds, J., Paths, trees and flowers, Canad. J. math., 17, 449-467, (1965) · Zbl 0132.20903
[3] Even, S.; Kariv, O., An O(n2.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 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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.