Equivalence between the minimum covering problem and the maximum matching problem

DOI10.1016/0012-365X(84)90170-5zbMath0581.05045MaRDI QIDQ1068107

Ján Plesník

Publication date: 1984

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

maximum matching problem; minimum covering problem

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

Constrained weighted matchings and edge coverings in graphs

Cites Work

• An Algorithm for a Minimum Cover of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item