1 paper · 1 filter
Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman +1
A graph is said to be a Konig graph if the size of its maximum matching is equal to the size of its minimum vertex cover. The Konig Edge Deletion problem asks if in a given graph t…