Bounding the Number of Edges of Matchstick Graphs

DOI10.1137/21M1441134zbMath1486.05146arXiv2108.07522OpenAlexW3194765882MaRDI QIDQ5067427

Konrad J. Swanepoel, Jérémy Lavollée

Publication date: 1 April 2022

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2108.07522

zbMATH Keywords

matchstick graphplane unit-distance graphpenny graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)

Related Items (1)

The number of small-degree vertices in matchstick graphs

Cites Work

• Unnamed Item
• Regular Matchstick Graphs
• Research Problems in Discrete Geometry
• Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs
• The Isoperimetric Problem

This page was built for publication: Bounding the Number of Edges of Matchstick Graphs