A lower bound for 4-regular planar unit distance graphs

zbMATH Open1262.05033arXiv1401.4377MaRDI QIDQ4906866

Sascha Kurz

Publication date: 28 February 2013

Abstract: We perform an exhaustive search for the minimum 4-regular unit distance graph resulting in a lower bound of 34 vertices.

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

zbMATH Keywords

regular graphcomputer searchunit distance graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

A tight bound for the number of edges of matchstick graphs ⋮ Title not available (Why is that?)

This page was built for publication: A lower bound for 4-regular planar unit distance graphs

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