
MatchStickGraph 6.0
Free
Latest version:
6.0
See all
Developer:
peterk
The MatchStickGraph is a type of graph that consists of a single edge and an equilateral triangle as its minimal 1- and 2-regular forms, respectively. The minimal known 4-regular MatchStickGraph is called the Harborth Graph, but it is yet to be proven optimal. Mathematica implements MatchStickGraphs as GraphData[%22Matchstick%22, n].
Comments