File:Greedy colorings.svg: Difference between revisions

From Gnomon Chronicles
Jump to navigation Jump to search
(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 == <...)
 
No edit summary
Line 25: Line 25:


[[Category:Nonfiction (nonfiction)]]
[[Category:Nonfiction (nonfiction)]]
[[Category:Diagrams (nonfiction)]]
[[Category:Graph coloring (nonfiction)]]
[[Category:Graph coloring (nonfiction)]]
[[Category:Graph theory (nonfiction)]]
[[Category:Graph theory (nonfiction)]]
[[Category:Mathematicians (nonfiction)]]
[[Category:Mathematicians (nonfiction)]]

Revision as of 09:47, 3 September 2018

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

Fiction cross-reference

Nonfiction cross-reference

External links:

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

You cannot overwrite this file.

Metadata

This file contains additional information, probably added from the digital camera or scanner used to create or digitize it.

If the file has been modified from its original state, some details may not fully reflect the modified file.

Retrieved from "https://gnomonchronicles.com/w/index.php?title=File:Greedy_colorings.svg&oldid=33969"