|
|
A303792
|
|
Number of connected matchstick graphs on n nodes.
|
|
1
|
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(6) is one less than A059103(6) because the 3-prism graph Y_3 cannot be drawn in an embedding that is both planar and unit-distance.
There are 11 connected graphs on 7 nodes that are unit-distance but non-matchstick (including Y_3+e and the Moser spindle).
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|