MAKE A MEME View Large Image Sumner claw-free matching.svg claw-free graph of even order has a perfect matching if v is a farthest vertex from u and w is a neighbor of v that is as far from u as possible then removing v and w from the graph leaves the rest connected so ...
View Original:Sumner claw-free matching.svg (315x198)
Download: Original    Medium    Small Thumb
Courtesy of:commons.wikimedia.org More Like This
Keywords: Sumner claw-free matching.svg claw-free graph of even order has a perfect matching if v is a farthest vertex from u and w is a neighbor of v that is as far from u as possible then removing v and w from the graph leaves the rest connected so repeatedly removing matched pairs in this way eventually forms a perfect matching Own David Eppstein 2009-02-18 Matching graph theory Undirected planar graphs Files by User David Eppstein from en wikipedia
Terms of Use   Search of the Day