# Find a maximum matching in this graph

I need to find a maximum matching in the graph below. I have to use the bold edges for this. I would say that adding the edges $$2-6$$ and $$7-8$$ should suffice. Is there a way how I could argue that this matching is indeed a maximum matching?