On the NP-completeness of the perfect matching free subgraph problem

Maximum matching and a polyhedron with 0,1-vertices

Jack Edmonds · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · 1965 · 1.7K citations · Full text

Coverings of Bipartite Graphs

A. L. Dulmage, N. S. Mendelsohn · Canadian Journal of Mathematics · 1958 · 464 citations · Full text

Geometric Graph Theory, Network Science, Graph Theory +13

An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs

Zvi Galil, Silvio Micali, Harold N. Gabow · SIAM Journal on Computing · 1986 · 130 citations · Full text

Engineering, Priority Queue, Network Analysis +20

Blockers and transversals

Rico Zenklusen, Bernard Ries, C. Picouleau et al. · Discrete Mathematics · 2009 · 59 citations · Full text

Block Design, Combinatorial Design

Minimum d-blockers and d-transversals in graphs

Marie-Christine Costa, D. de Werra, Christophe Picouleau · Journal of Combinatorial Optimization · 2010 · 31 citations · Full text

Mathematical Programming, Engineering, Graph Theory +8