A catalog of matchstick graphs
Combinatorics
2015-01-06 v5 Discrete Mathematics
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.
Keywords
Cite
@article{arxiv.1303.5965,
title = {A catalog of matchstick graphs},
author = {Raffaele Salvia},
journal= {arXiv preprint arXiv:1303.5965},
year = {2015}
}
Comments
88 pages, 2 tables, 7 plots