Let, G be a Graph, M a matching on G and Q be a vertex cover of G. Then, prove that |M| ≤ |Q|
Posted: Thu Apr 28, 2022 6:42 am
Let, G be a Graph, M a matching on G and Q be a vertex cover of
G. Then, prove that |M| ≤ |Q|
G. Then, prove that |M| ≤ |Q|