File:Koenigs-theorem-graph.png
From Wikimedia Commons, the free media repository
Jump to navigation
Jump to search
Koenigs-theorem-graph.png (450 × 306 pixels, file size: 15 KB, MIME type: image/png)
File information
Structured data
Captions
Summary
[edit]File:Koenigs-theorem-graph.svg is a vector version of this file. It should be used in place of this PNG file when not inferior.
File:Koenigs-theorem-graph.png → File:Koenigs-theorem-graph.svg
For more information, see Help:SVG.
|
DescriptionKoenigs-theorem-graph.png | en:König's theorem (graph theory) states that any en:bipartite graph has a en:maximum matching of equal size to a minimum en: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. |
Date | 25 October 2006 (original upload date) |
Source | Transferred from en.wikipedia to Commons. |
Author | David Eppstein at English Wikipedia |
Licensing
[edit]Public domainPublic domainfalsefalse |
This work has been released into the public domain by its author, David Eppstein at English Wikipedia. This applies worldwide. In some countries this may not be legally possible; if so: David Eppstein grants anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law.Public domainPublic domainfalsefalse |
Original upload log
[edit]The original description page was here. All following user names refer to en.wikipedia.
- 2006-10-25 19:52 David Eppstein 450×306×8 (15099 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
File history
Click on a date/time to view the file as it appeared at that time.
Date/Time | Thumbnail | Dimensions | User | Comment | |
---|---|---|---|---|---|
current | 17:00, 4 May 2007 | 450 × 306 (15 KB) | Tgr (talk | contribs) | {{Information |Description=en:König's theorem (graph theory) states that any en:bipartite graph has a en:maximum matching of equal size to a minimum en:vertex cover. This image depicts a bipartite graph with 14 vertices, in which the |
You cannot overwrite this file.
File usage on Commons
There are no pages that use this file.
File usage on other wikis
The following other wikis use this file:
- Usage on de.wikipedia.org
- Usage on hu.wikipedia.org