Recursively generate 3-regular planar graphs

67 Views Asked by At

I'm trying to prove that there are an unbounded number of (non-isomorphic) 3-regular planar graphs with faces of degree 3 or 6. I know that there are only 4 faces of degree 3 in such a graph. I cannot find a way to recursively generate such graphs, however. I have looked at some examples but was unable to find any recurring pattern.

1

There are 1 best solutions below

3
On

One recursive construction is to take a picture like the following, with a triangle surrounded by "layers" of hexagons:

enter image description here

Then, put four of these pictures together as the sides of a tetrahedron.