i woke up at 3am and then made this for an hour-and-a-half.. there wasn’t any system but i don’t think im missing any (lmk!). must use all 3 colors & same color can’t touch. darker color on the left just to keep track of duplicates
seen from United States

seen from United States

seen from United States
seen from China
seen from China
seen from Türkiye

seen from United States

seen from United States
seen from South Korea
seen from South Korea
seen from Yemen
seen from United Kingdom

seen from Malaysia
seen from Malaysia

seen from Canada
seen from China
seen from United States
seen from China
seen from Finland
seen from China
i woke up at 3am and then made this for an hour-and-a-half.. there wasn’t any system but i don’t think im missing any (lmk!). must use all 3 colors & same color can’t touch. darker color on the left just to keep track of duplicates
What is Graph Coloring?
What is Graph Coloring?
In graph theory, given a set of vertices and edges connecting them, the Graph Coloring Problem involves assigning ‘colors’ (labels, numbers) to vertices. These colors have to follow one important rule. No two vertices connected by an edge can be of the same color. (This is the Vertex Coloring problem. Similarly there is an edge coloring problem.)
Why the interest in Graph Coloring problems?
It turns out that quite a number of problems in life (from classroom to sports team scheduling, time-tabling, to Sudoku) can be mapped to be Graph Coloring problems. And therefore, modeling a problem as a Graph Coloring problem and learning to solve them become very valuable skills.
For more details
Wikipedia page on Graph Coloring
http://en.wikipedia.org/wiki/Graph_coloring
Michael Trick’s GC and clique document
http://mat.gsia.cmu.edu/COLOR/color.html
Graph Coloring Resources Page – Joseph Culberson
http://webdocs.cs.ualberta.ca/~joe/Coloring/