File:Sumner claw-free matching.svg
Jump to navigation
Jump to search
Size of this PNG preview of this SVG file: 315 × 198 pixels. Other resolutions: 320 × 201 pixels | 640 × 402 pixels | 1,024 × 644 pixels | 1,280 × 805 pixels | 2,560 × 1,609 pixels.
Original file (SVG file, nominally 315 × 198 pixels, file size: 2 KB)
Summary
| Description |
English: Illustration for Sumner's proof that every connected 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. |
| Date | |
| Source | Own work |
| Author | David Eppstein |
Licensing
|
I, the copyright holder of this work, release this work into the public domain. This applies worldwide. In some countries this may not be legally possible; if so: I grant anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law. |
File history
Click on a date/time to view the file as it appeared at that time.
| Date/Time | Thumbnail | Dimensions | User | Comment | |
|---|---|---|---|---|---|
| current | 07:01, 19 February 2009 | | 315 × 198 (2 KB) | wikimediacommons>David Eppstein | {{Information |Description={{en|1=Illustration for Sumner's proof that every connected 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 |
File usage
The following page uses this file:
