MatchStickGraph

MatchStickGraph 6.0

Free
The minimal 1-regular matchstick graph is a single graph edge
 
6.0 (See all)

The minimal 1-regular matchstick graph is a single graph edge, and the minimal 2-regular graph is an equilateral triangle. The minimal known 4-regular matchstick graph is known as the Harborth graph (Hartsfield and Ringel 1994; Timm) but has not been proven optimal. These are illustrated above and summarized in the table below. The matchstick graphs are implemented in Mathematica as GraphData["Matchstick", n].

Info updated on: