Year: 2013
Type: preprint
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.
Source: arXiv (Cornell University)
Author: Salvia, Raffaele
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1940427013