A tight bound for the number of edges of matchstick graphs

DOI10.1007/s00454-023-00530-zMaRDI QIDQ6642298

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

Publication date: 22 November 2024

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

matchstick graphplane unit-distance graphpenny graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Erd?s problems and related topics of discrete geometry (52C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new 4-regular matchstick graph
• Symbol-crunching the Harborth graph
• Regular Matchstick Graphs
• Who Needs Crossings? Hardness of Plane Graph Rigidity
• Research Problems in Discrete Geometry
• Fast regocnition of planar non unit distance graphs
• A lower bound for 4-regular planar unit distance graphs
• The number of small-degree vertices in matchstick graphs
• Bounding the Number of Edges of Matchstick Graphs
• A 3-regular matchstick graph of girth 5 consisting of 54 vertices
• The Isoperimetric Problem
• New minimal (4; n)-regular matchstick graphs
• 3-regular matchstick graphs with given girth
• Lagerungen

Related Items (1)

General penny graphs are at most \(\frac{43}{18}\)-dense

This page was built for publication: A tight bound for the number of edges of matchstick graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6642298)