I am interested in undirected, planar, connected graphs where every edge is in a 3-cycle. If there are 4 vertices then, up to isomorphism, there are two such graphs.
How many are there for 5 vertices?
I am interested in undirected, planar, connected graphs where every edge is in a 3-cycle. If there are 4 vertices then, up to isomorphism, there are two such graphs.
How many are there for 5 vertices?
Copyright © 2021 JogjaFile Inc.

There are really not that many graphs with $5$-vertices up to isomorphism, so this is really just a matter of checking them out. Here are all $34$ of them:
$K_5$ is the only non-planar of the bunch and its easy to get rid the unconnected ones.