Let a connected bridgeless planar graph have vertices, edges, no four-cycle, and triangular faces. If no edge borders two triangular faces, thenso . The Euler formula for a connected planar graph then gives
The icosidodecahedral graph is the skeleton of the icosidodecahedron. It has 30 vertices, 60 edges, 20 triangular faces, and 12 pentagonal faces. Every edge separates a triangle from a pentagon, so it attains equality in the triangle-pentagon planar edge bound.
Articles by others on the same topic
There are currently no matching articles.