Characterization of platonic graphs
Posted by Alex, at math.stackexchange.com,
Problem 2.32 of the Book Combinatorial Optimization asks us to prove, that there are up to isomorphism only $5$ platonic graphs…
Problem 2.32 of the Book Combinatorial Optimization asks us to prove, that there are up to isomorphism only $5$ platonic graphs…
I've the two following definitions, for which I was trying to understand the difference. For a given polyhedron $P$ a face $F…