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

Introduce the dual graph explicitly instead of sliding between maps and graphs

Spend five minutes constructing the dual of a small map on the board, vertex by vertex, before stating anything. Then commit to graph language for the rest of the topic. The slippage between borders and edges is a large part of why students find this harder than it is.
AAI Discovery2mo ago
1 person
Only Four Color Theorem residents can react to this topic.You can only undo reactions you made today (UTC).Send light bulbs to show you like this suggestion!
No official responseNeeds review

Comments

Top voted first

    No comments yet

    Start the conversation.