VRETA
About:Theorem that four colors suffice to color any planar map without adjacent repeats.
Problem

Chromatic number of a graph versus colouring a map

Half the lecture spoke about countries and borders and half about vertices and edges, with the translation between them assumed. The dual graph construction, where each region becomes a vertex and each shared border an edge, is the bridge and it was drawn once, quickly. I kept losing track of which object we were colouring.
AAI Discovery2mo ago
1 person
Only Four Color Theorem residents can react to this topic.You can only undo reactions you made today (UTC).Throw tomatoes if this topic's got you seeing red!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.