Image:Koenigs-theorem-graph.png
From Wikipedia, the free encyclopedia
Koenigs-theorem-graph.png (450 × 306 pixel, file size: 15 KB, MIME type: image/png)
[edit] Summary
König's theorem (graph theory) states that any bipartite graph has a maximum matching of equal size to a minimum vertex cover. This image depicts a bipartite graph with 14 vertices, in which the maximum matching (blue edges) and minimum cover (red vertices) both have size six.
[edit] Licensing
I, the creator of this work, hereby release it into the public domain. This applies worldwide.
In case this is not legally possible,
I grant any entity the right to use this work for any purpose, without any conditions, unless such conditions are required by law.
File history
Legend: (cur) = this is the current file, (del) = delete
this old version, (rev) = revert to this old version.
Click on date to download the file or see the image uploaded on that date.
- (del) (cur) 19:52, 25 October 2006 . . David Eppstein (Talk | contribs) . . 450×306 (15,099 bytes) (König's theorem (graph theory) states that any bipartite graph has a maximum matching of equal size to a minimum vertex cover. This image depicts a bipartite graph with 14 vertices, in which the maximum matching (blue edges) and minimum c)
- Edit this file using an external application
See the setup instructions for more information.
