Crossmark

A Tight Bound for the Number of Edges of Matchstick Graphs

Crossref DOI link: https://doi.org/10.1007/s00454-023-00530-z

Published Online: 2023-08-18

Published Print: 2024-12

Update policy: https://doi.org/10.1007/springer_crossmark_policy

Authors

Lavollée, Jérémy

Swanepoel, Konrad https://orcid.org/0000-0002-1668-887X
License Information

Text and Data Mining valid from 2023-08-18

Version of Record valid from 2023-08-18
More Information

Article History

Received: 20 September 2022

Revised: 24 February 2023

Accepted: 26 February 2023

First Online: 18 August 2023