We say that a graph $G$ is divisive, if we can write a positive integer on each of its vertices such that all the integers are distinct, and any two of these integers divide each other if and only if there is an edge running between them in $G$. Which Platonic solids form a divisive graph?
Problem
Source: (2022 -) 2023 XVI Dürer Math Competition Regional E+2
Tags: combinatorics, graph theory, graph