研究论文
Regular Matchstick Graphs
Sascha Kurz, Rom Pinchasi
The University of Western Australia University of Bayreuth Technion – Israel Institute of Technology
来源American Mathematical Monthly
年份2011
内容与影响
摘要 · 完整
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.
逐年被引趋势
320
13
314
18
19
22
23
25
关键指标
11
被引次数 · OpenAlex
1.48
领域内被引倍数
同类平均 = 1
同类平均 = 1
前 19%
引用位次
同领域 · 同年份 · 同类型
同领域 · 同年份 · 同类型
5
参考文献
Google Scholar 与 OpenAlex 的被引统计范围不同，数值存在差异属正常。
AI 辅助阅读
依据：摘要
论文问答
依据：摘要 · 当前未解析全文
回答优先基于摘要、文献信息与可获取全文；依据不足时会明确说明。
学术脉络
学科主题
计算机 / AIAdvanced Graph Theory Research
graph theory and CDMA systems · Finite Group Theory Research
参考文献 5
PEARLS in GRAPH THEORY
被引 151Nora Hartsfield, Gerhard Ringel · 2007
Research Problems in Discrete Geometry
被引 790Peter Braß, W. O. J. Moser, János Pach · 2005
Minimal Polynomials for the Coordinates of the Harborth Graph
被引 8Eberhard H.-A. Gerbracht · arXiv (Cornell University) · 2006
此处列出前 3 条
施引文献 11
On topological graphs with at most four crossings per edge
被引 15Eyal Ackerman · Computational Geometry · 2019
3-regular matchstick graphs with given girth
被引 5Sascha Kurz, Giuseppe Mazzuoccolo · arXiv (Cornell University) · 2014
A Tight Bound for the Number of Edges of Matchstick Graphs
被引 2Jérémy Lavollée, Konrad J. Swanepoel · Discrete & Computational Geometry · 2023
按被引量排序，此处列出前 3 条