# A catalog of matchstick graphs

- Published in 2013
- Added on

In the collection

Classification of planar unit-distance graphs with up to 9 edges, by homeomorphism and isomorphism classes. With exactly nine edges, there are 633 nonisomorphic connected matchstick graphs, of which 196 are topologically distinct from each other. Increasing edges' number, their quantities rise more than exponentially, in a still unclear way.

## Links

### BibTeX entry

@article{Acatalogofmatchstickgraphs, title = {A catalog of matchstick graphs}, abstract = {Classification of planar unit-distance graphs with up to 9 edges, by homeomorphism and isomorphism classes. With exactly nine edges, there are 633 nonisomorphic connected matchstick graphs, of which 196 are topologically distinct from each other. Increasing edges' number, their quantities rise more than exponentially, in a still unclear way.}, url = {http://arxiv.org/abs/1303.5965v5 http://arxiv.org/pdf/1303.5965v5}, year = 2013, author = {Raffaele Salvia}, comment = {}, urldate = {2022-02-16}, archivePrefix = {arXiv}, eprint = {1303.5965}, primaryClass = {math.CO}, collections = {lists-and-catalogues} }