Jump to content

File:Koenigs-theorem-graph.png

Page contents not supported in other languages.
This is a file from the Wikimedia Commons
From Wikipedia, the free encyclopedia

Koenigs-theorem-graph.png (450 × 306 pixels, file size: 15 KB, MIME type: image/png)

Summary

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.
In other languages
Alemannisch ∙ العربية ∙ беларуская (тарашкевіца) ∙ български ∙ বাংলা ∙ català ∙ нохчийн ∙ čeština ∙ dansk ∙ Deutsch ∙ Ελληνικά ∙ English ∙ British English ∙ Esperanto ∙ español ∙ eesti ∙ euskara ∙ فارسی ∙ suomi ∙ français ∙ Frysk ∙ galego ∙ Alemannisch ∙ עברית ∙ hrvatski ∙ magyar ∙ հայերեն ∙ Bahasa Indonesia ∙ Ido ∙ italiano ∙ 日本語 ∙ ქართული ∙ 한국어 ∙ lietuvių ∙ македонски ∙ മലയാളം ∙ Bahasa Melayu ∙ norsk bokmål ∙ Plattdüütsch ∙ Nederlands ∙ norsk nynorsk ∙ norsk ∙ occitan ∙ polski ∙ prūsiskan ∙ português ∙ português do Brasil ∙ română ∙ русский ∙ sicilianu ∙ Scots ∙ slovenčina ∙ slovenščina ∙ српски / srpski ∙ svenska ∙ தமிழ் ∙ ไทย ∙ Türkçe ∙ татарча / tatarça ∙ українська ∙ vèneto ∙ Tiếng Việt ∙ 中文 ∙ 中文（中国大陆） ∙ 中文（简体） ∙ 中文（繁體） ∙ 中文（马来西亚） ∙ 中文（新加坡） ∙ 中文（臺灣） ∙ 中文（臺灣） ∙ +/−
New SVG image

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 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

Public domain 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.

Original upload log

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

Captions

Add a one-line explanation of what this file represents

Items portrayed in this file

depicts

inception

25 October 2006

media type

image/png

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeThumbnailDimensionsUserComment
current17:00, 4 May 2007Thumbnail for version as of 17:00, 4 May 2007450 × 306 (15 KB)Tgr{{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
No pages on the English Wikipedia use this file (pages on other projects are not listed).

Global file usage

The following other wikis use this file:

Retrieved from "https://en.wikipedia.org/wiki/File:Koenigs-theorem-graph.png"