A catalog of matchstick graphs

📝 Original Info

• Title: A catalog of matchstick graphs
• ArXiv ID: 1303.5965
• Date: 2015-01-06
• Authors: Researchers from original ArXiv paper

📝 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.

💡 Deep Analysis

Deep Dive into A catalog of matchstick graphs.

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.

📄 Full Content

Reference