Abstract
The Harborth graph is widely regarded as the smallest known example of a 4-regular planar unit-distance graph. In this paper we sketch an exact proof of this property, and present some of the minimal polynomials of the coordinates of the vertices of its most prominent embedding, the calculations of which give an example for the heavy use of computer algebra in the area of geometric graph theory. Finally we use the particular algebraic structure of these polynomials to deduce some geometric properties of the Harborth graph.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
