Abstract
A matchstick graph is a plane geometric graph in which every edge has length 1 and no two edges cross each other. It was conjectured that no 5-regular matchstick graph exists. In this paper we prove this conjecture.
| Original language | English |
|---|---|
| Pages (from-to) | 264-267 |
| Number of pages | 4 |
| Journal | American Mathematical Monthly |
| Volume | 118 |
| Issue number | 3 |
| DOIs | |
| State | Published - Mar 2011 |
ASJC Scopus subject areas
- General Mathematics
Fingerprint
Dive into the research topics of 'Regular matchstick graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver