e/Matchstick graph

Information
has gloss	eng: In geometric graph theory, a branch of mathematics, a matchstick graph is a graph that can be drawn in the plane in such a way that its edges are line segments with length one that do not cross each other. That is, it is a graph that is simultaneously a unit distance graph and a planar graph. Informally, matchstick graphs can be made by placing noncrossing matchsticks on a flat surface, hence the name.
lexicalization	eng: Matchstick Graph
instance of	c/Geometric graphs

Media
media:img	Harborth graph.jpg