A Planar Graph whose Edges are all unit line segments. The minimal number of Edges for matchstick graphs of various degrees are given in the table below. The minimal degree 1 matchstick graph is a single Edge, and the minimal degree 2 graph is an Equilateral Triangle.

1 | 1 | 2 |

2 | 3 | 3 |

3 | 12 | 8 |

4 | 42 |

© 1996-9

1999-05-26