This image was acquired from
wikimedia. It was marked as Public Domain or CC0 and is free to use. To verify, go to the source and check the information there.
Keywords from Image Description:
Sumner clawfree matching.svg clawfree graph of even order has perfect matching if is farthest vertex from and is neighbor of that is as far from as possible then removing and from the graph leaves the rest connected so repeatedly removing matched pairs in this way eventually forms perfect matching Own David Eppstein Matching graph