4-regular planar unit triangle graphs without additional triangles

MaRDI QIDQ5132844zbMATH OpenFDO

Authors Mike Winkler, Peter Dinkelacker, Stefan Vogel

Publication date 12 November 2020

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

zbMATH Keywords

4-regular planar unit-distance graphs

Mathematics Subject Classification ID

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

Abstract: In this article we proof the existence of 4-regular planar unit-distance graphs consisting only of unit triangles without additional triangles. It is shown that the smallest number of unit triangles is $leq$6422.

Recommendations

• A lower bound for 4-regular planar unit distance graphs
• scientific article; zbMATH DE number 866042
• scientific article; zbMATH DE number 866036
• scientific article; zbMATH DE number 874074
• scientific article; zbMATH DE number 6667214

Cited in

(2)

• A lower bound for 4-regular planar unit distance graphs
• Symbol-crunching the Harborth graph

This page was built for publication: 4-regular planar unit triangle graphs without additional triangles

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