File:Greedy colorings.svg

From Gnomon Chronicles
Jump to navigation Jump to search

Original file(SVG file, nominally 303 × 188 pixels, file size: 9 KB)

Nonfiction: Two greedy colorings of the same graph using different vertex orders. The right example generalises to 2-colorable graphs with n vertices, where the greedy algorithm expends n/2 colors.

Attribution

By Thore Husfeldt - Own work, CC BY-SA 3.0, https://commons.wikimedia.org/w/index.php?curid=5399420

File history

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

Date/TimeThumbnailDimensionsUserComment
current09:47, 3 September 2018Thumbnail for version as of 09:47, 3 September 2018303 × 188 (9 KB)Admin (talk | contribs)Nonfiction: Two greedy colorings of the same graph using different vertex orders. The right example generalises to 2-colorable graphs with n vertices, where the greedy algorithm expends n/2 colors. == In the News == <...

Metadata