Revision as of 22:58, 7 November 2021 edit Headbomb (talk \| contribs) Edit filter managers, Autopatrolled, Extended confirmed users, Page movers, File movers, New page reviewers, Pending changes reviewers, Rollbackers, Template editors 448,105 edits ce ← Previous edit		Revision as of 03:37, 30 January 2022 edit undo Citation bot (talk \| contribs) Bots 5,184,777 edits Alter: template type. \| Use this bot. Report bugs. \| Suggested by AManWithNoPlan \| #UCB_webform 133/1682 Next edit →
Line 54: \| volume = 47 \| year = 2011\| doi-access = free }}. For additional details see the earlier preprint in {{cite ~~arxiv~~arXiv \|eprint=math/0609360 \|last1=Gerbracht \|first1=Eberhard H.-A. \|title=Minimal Polynomials for the Coordinates of the Harborth Graph \|year=2006 \|mode=cs2}}.</ref> Every 4-regular matchstick graph contains at least 20 vertices.<ref name="Kurz,Pinchasi,2011">{{citation Line 164: ==Combinatorial enumeration== The numbers of distinct (nonisomorphic) matchstick graphs are known for 1, 2, 3, ... up to ten edges; they are: :1, 1, 3, 5, 12, 28, 74, 207, 633, 2008 {{OEIS\|A066951}}<ref>{{cite ~~arxiv~~arXiv \| last = Salvia \| first = Raffaele \| year = 2013

Matchstick graph: Difference between revisions